The persistent-access-caching algorithm

Random Structures and Algorithms

Volumn 33, Issue 2, 2008, Pages 219-251

  Jelenković, Predrag R ^a   Radovanović, Ana ^b  

^a Columbia University ^*  (United States)

^b GOOGLE INC   (United States)

Author keywords

Average case analysis; Cache fault probability; Generalized Zipf's law distributions; Heavy tailed distributions; Least frequently used caching; Least recently used caching; Move to front searching; Persistent access caching; Web caching

Indexed keywords

EID: 52349096085     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20214     Document Type: Article

References (17)

1. M. Abramowitz and I. A. Stegun (Editors), Handbook of mathematical functions, Dover, New York, 1974.
2. V. Almeida, A. Bestavros, M. Crovella, and A. de Oliviera, Characterizing reference locality in the WWW, Proc IEEE Conf PDIS, 1996, pp. 92-103.
3. O. Bahat and A. M. Makowski, Optimal replacement policies for non-uniform cache objects with optional eviction, Proc 22nd conf IEEE INFOCOM, 2003, pp. 427-437.
4. W. A. Borodin, S. Irani, P. Raghavan, and B. Schieber, Competitive paging with locality of reference, J Comput Syst Sci 50 (1995), 244-258.
5. E. Cinlar, Introduction to stochastic processes, Prentice-Hall, Englewood Cliffs, NJ, 1975.
6. J. A. Fill, Limits and rate of convergence for the distribution of search cost under the move-to-front rule, Theor Comput Sci 164 (1996), 185-206.
7. J. A. Fill and L. Holst, On the distribution of search cost for the move-to-front rule, Random Structures Algorithms 8 (1996), 179-186.
8. P. Flajolet, D. Gardy, and L. Thimonier, Birthday paradox, coupon collector, caching algorithms and self-organizing search, Discrete Appl Math 39 (1992), 207-229.
9. G. H. Gonnet, J. I. Munro, and H. Suwanda, Exegesis of self-organizing linear search, SIAM J Comput 10 (1981), 613-637.
10. P. R. Jelenković, Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities, Ann Appl Probability 9 (1999), 430-464.
11. P. R. Jelenković, Least-recently-used caching with Zipf's law requests, 6th INFORMS Telecommunications Conf, Boca Raton, FL, 2002.
12. P. R. Jelenković and A. Radovanović, Least-recently-used caching with dependent requests, Theor Comput Sci 326 (2004), 293-327.
13. P. R. Jelenković and A. Radovanović, Optimizing LRU caching for variable document sizes, Combin Probab Comput 13 (2004), 627-643.
14. Y. C. Kan and S. M. Ross, Optimal list order under partial memory constraints, J Appl Probab 17 (1980), 1004-1015.
15. T. Kimbrel, Online paging and file caching with expiration times, Theor Comput Sci 268 (2001), 119-131.
16. E. J. O'Neil, P. E. O'Neil, and G. Weikum, An optimality proof of the LRU-K page replacement algorithm, J ACM 46 (1999), 92-112.
17. T. Sugimoto and N. Miyoshi, On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution, Random Structures Algorithms 29 (2005), 296-323.