Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Journal of Algorithms
On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
Randomized and multipointer paging with locality of reference
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Information Processing Letters
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Operating Systems Theory
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A unified analysis of paging and caching
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
Algorithms for two graph problems: computing maximum-genus imbeddings and the two-server problem
Competitive k-server algorithms
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Beyond competitive analysis [on-line algorithms]
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A study of replacement algorithms for a virtual-storage computer
IBM Systems Journal
| Hi-index | 0.00 |
We provide new competitive upper bounds on the performance of the memoryless, randomized caching algorithm RAND. Our bounds are expressed in terms of the inherent hit rate α of the sequence of memory references, which is the highest possible hit rate that any algorithm can achieve on the sequence for a cache of a given size. Our results show that RAND is (1 - αe-1/α)/(1 - α)-competitive on any reference sequence with inherent hit rate α. Since our new competitive bound does not scale up with the size k of the cache, it beats the putative Ω(lg k) lower bound on the competitiveness of randomized caching algorithms.