LRU is better than FIFO

Algorithmica (New York)

Volumn 23, Issue 2, 1999, Pages 180-185

  Chrobak, M ^a   Noga, J ^b  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Caching; Competitive analysis; On line algorithms; Paging

Indexed keywords

EID: 0008780485     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009255     Document Type: Article

References (10)

1. L. A. Belady, A study of replacement algorithms for virtual storage computers. IBM Systems Journal, 5:78-101, 1966.
2. A. Borodin, S. Irani, P. Raghavan, and B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences, 50(2):244-258, 1995.
3. P. J. Denning. Working sets pas! and present. IEEE Transactions on Software Engineering, 6:64-84, 1980.
4. A. Fiat and A. Karlin. Randomized and multipointer paging with locality of reference. In Proc. 21th ACM Symposium on Theory of Computing, pages 626-634, 1995.
5. A. Fiat and M. Mendel. Truly online paging with locality of reference. In Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 326-335, 1997.
6. S. Irani, A. Karlin, and S. Phillips. Strongly competitive algorithms for paging with locality of reference. In Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 228-236, 1992.
7. T. Kilburn, D. Edwards, M. Lanigan, and F. Sumner. One-level storage system. IRE Transactions on Electronics and Computers, 37:223-235, 1962.
8. G. Shedler and C. Tung. Locality in page reference strings. SIAM Journal on Computing, 1:218-241, 1972.
9. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
10. N. Young. On-line caching as cache size varies. In Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 241-250, 1991.