Least-recently-used caching with dependent requests

Theoretical Computer Science

Volumn 326, Issue 1-3, 2004, Pages 293-327

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

^a Columbia University ^*  (United States)

Author keywords

Average case analysis; Heavy tailed distributions; Least recently used caching; Long range dependence; Move to front; Semi Markov processes; Zipf's law

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; CORRELATION METHODS; FREQUENCIES; MARKOV PROCESSES; PROBABILITY; ROBUSTNESS (CONTROL SYSTEMS); STATISTICAL METHODS; WORLD WIDE WEB;

AVERAGE-CASE ANALYSIS; HEAVY-TAILED DISTRIBUTIONS; LEAST-RECENTLY-USED CACHING; LONG-RANGE DEPENDENCE (LRD); MOVE-TO-FRONT; SEMI-MARKOV PROCESS; ZIPF'S LAW;

CACHE MEMORY;

EID: 5144233401     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.029     Document Type: Article

References (26)

1. V. Almeida, A. Bestavros, M. Crovella, A. de Oliviera, Characterizing reference locality in the WWW, in: Proceedings of the Fourth International Conference on Parallel and Distributed Information Systems, Miami Beach, Florida, December 1996.
2. F. Baccelli, P. Brémaud, Elements of Queueing Theory, Springer, Berlin, 2002.
3. J.L. Bentley, C.C. McGeoch, Amortized analysis of self-organizing sequential search heuristics, Comm. ACM 28 (4) (1985) 404-411.
4. J.R. Bitner, Heuristics that dynamically organize data structures, SIAM J. Comput. 8 (1979) 82-110.
5. W.A. Borodin, S. Irani, P. Raghavan, B. Schieber, Competitive paging with locality of reference, J. Comput. System Sci. 50 (2) (1995) 244-258.
6. P.J. Burville, J.F.C. Kingman, On a model for storage and search, J. Appl. Probab. 10 (1973) 697-701.
7. E. Cinlar, Introduction to Stochastic Processes, Prentice-Hall, Englewood Cliffs, NJ, 1975.
8. E.G. Coffman, P.R. Jelenković, Performance of the move-to-front algorithm with Markov-modulated request sequences, Oper. Res. Lett. 25 (1999) 109-118.
9. A. Dembo, O. Zeitouni, Large Deviations Techniques and Applications, Jones and Bartlett Publishers, Boston, 1993.
10. R.P. Dobrow, J.A. Fill, The move-to-front rule for self-organizing lists with Markov dependent requests, in: D. Aldous, P. Diaconis, J. Spencer, J.M. Steele (Eds.), Discrete Probability and Algorithms, Springer, Berlin, 1995, pp. 57-80.
11. J.A. Fill, An exact formula for the move-to-front rule for self-organizing lists, J. Theoret. Probab. 9 (1) (1996) 113-159.
12. J.A. Fill, Limits and rate of convergence for the distribution of search cost under the move-to-front rule, Theoret. Comput. Sci. 164 (1996) 185-206.
13. J.A. Fill, L. Holst, On the distribution of search cost for the move-to-front rule, Random Struct. and Algorithms 8 (3) (1996) 179-186.
14. P. Flajolet, D. Gardy, L. Thimonier, Birthday paradox, coupon collector, caching algorithms and self-organizing search, Discrete Appl. Math. 39 (1992) 207-229.
15. S. Irani, A.R. Karlin, S. Philips, Strongly competitive algorithms for paging with locality of reference, SIAM J. Comput. 25 (3) (1996) 477-497.
16. P.R. Jelenković, Asymptotic approximation of the move-to-front search cost distribution and least-recently-used caching fault probabilities, The Ann. Appl. Probab. 9 (2) (1999) 430-464.
17. P.R. Jelenković, A.A. Lazar, Subexponential asymptotics of a Markov-modulated random walk with queueing applications, J. Appl. Probab. 35 (2) (1998) 325-347.
18. P.R. Jelenković, Petar Momčilović, Asymptotic loss probability in a finite buffer fluid queue with heterogeneous heavy-tailed on-off processes, The Ann. of App. Probab. 13 (2) (2003) 576-603.
19. D.E. Knuth, The Art of Computer Programming, Sorting and Searching, vol. 3, Addison-Wesley, Reading, MA, 1973.
20. J. McCabe, On serial files with relocatable records, Oper. Res. 13 (1965) 609-618.
21. S.V. Nagaev, Large deviations of sums of independent random variables, The Ann. Probab. 7 (5) (1979) 745-789.
22. R.M. Phatarfod, On the transition probabilities of the move-to-front scheme, J. Appl. Probab. 31 (1994) 570-574.
23. R. Rivest, On self-organizing sequential search heuristics, Commun. ACM 19 (2) (1976) 63-67.
24. E.R. Rodrigues, The performance of the move-to-front scheme under some particular forms of Markov requests, J. Appl. Probab. 32 (4) (1995) 1089-1102.
25. D.D. Sleator, R.E. Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM 28 (2) (1985) 202-208.
26. A. Weiss, A. Shwartz, Large Deviations for Performance Analysis: Queues Communications, and Computing, Chapman & Hall, New York, 1995.