Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Performance

arXiv:0903.4898 (cs)
[Submitted on 27 Mar 2009]

Title:Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests

Authors:Predrag R. Jelenkovic, Ana Radovanovic
View PDF
Abstract: It is well known that the static caching algorithm that keeps the most frequently requested documents in the cache is optimal in case when documents are of the same size and requests are independent and equally distributed. However, it is hard to develop explicit and provably optimal caching algorithms when requests are statistically correlated. In this paper, we show that keeping the most frequently requested documents in the cache is still optimal for large cache sizes even if the requests are strongly correlated.
Subjects: Performance (cs.PF); Data Structures and Algorithms (cs.DS)
Cite as: arXiv:0903.4898 [cs.PF]
  (or arXiv:0903.4898v1 [cs.PF] for this version)
  https://doi.org/10.48550/arXiv.0903.4898

Submission history

From: Predrag Jelenkovic [view email]
[v1] Fri, 27 Mar 2009 20:05:17 UTC (13 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.PF
< prev   |   next >
new | recent | 2009-03
Change to browse by:
cs
cs.DS

References & Citations

DBLP - CS Bibliography

listing | bibtex
Predrag R. Jelenkovic
Ana Radovanovic
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)