Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
On the distribution of search cost for the move-to-front rule
Random Structures & Algorithms
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On self-organizing sequential search heuristics
Communications of the ACM
Characterizing reference locality in the WWW
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
Performance of the move-to-front algorithm with Markov-modulated request sequences
Operations Research Letters
Analysis of scratch-pad and data-cache performance using statistical methods
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Characterizing the miss sequence of the LRU cache
ACM SIGMETRICS Performance Evaluation Review
Analysis of Page Replacement Policies in the Fluid Limit
Operations Research
Modelling and evaluation of CCN-caching trees
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
The Scope for online social network aided caching in web CDNs
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
Temporal locality in today's content caching: why it matters and how to model it
ACM SIGCOMM Computer Communication Review
Performance evaluation of the random replacement policy for networks of caches
Performance Evaluation
| Hi-index | 5.23 |
We investigate a widely popular least-recently-used (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the widely reported long-range dependence in the World Wide Web page request patterns. When the frequency of requesting a page n is equal to the generalized Zipf's law c/nα, α 1, our main result shows that the cache fault probability is asymptotically, for large cache sizes, the same as in the corresponding LRU system with i.i.d. requests. The result is asymptotically explicit and appears to be the first computationally tractable average-case analysis of LRU caching with statistically dependent request sequences. The surprising insensitivity of LRU caching performance demonstrates its robustness to changes in document popularity. Furthermore, we show that the derived asymptotic result and simulation experiments are in excellent agreement, even for relatively small cache sizes.