Skip to main content Accessibility help
×
Home

Critical sizing of LRU caches with dependent requests

  • Predrag R. Jelenković (a1), Ana Radovanović (a2) and Mark S. Squillante (a2)

Abstract

It was recently proved by Jelenković and Radovanović (2004) that the least-recently-used (LRU) caching policy, in the presence of semi-Markov-modulated requests that have a generalized Zipf's law popularity distribution, is asymptotically insensitive to the correlation in the request process. However, since the previous result is asymptotic, it remains unclear how small the cache size can become while still retaining the preceding insensitivity property. In this paper, assuming that requests are generated by a nearly completely decomposable Markov-modulated process, we characterize the critical cache size below which the dependency of requests dominates the cache performance. This critical cache size is small relative to the dynamics of the modulating process, and in fact is sublinear with respect to the sojourn times of the modulated chain that determines the dependence structure.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Critical sizing of LRU caches with dependent requests
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Critical sizing of LRU caches with dependent requests
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Critical sizing of LRU caches with dependent requests
      Available formats
      ×

Copyright

Corresponding author

Postal address: Department of Electrical Engineering, Columbia University, New York, NY 10027, USA. Email address: predrag@ee.columbia.edu
∗∗ Postal address: Department of Mathematical Sciences, IBM T. J. Watson Research Center, PO Box 218, Yorktown Heights, NY 10598, USA.
∗∗∗ Email address: aradovan@us.ibm.com
∗∗∗∗ Email address: mss@watson.ibm.com

Footnotes

Hide All

Supported by the NSF, grant no. 0092113.

Footnotes

References

Hide All
[1] Almeida, V., Bestavros, A., Crovella, M. and de Oliviera, A. (1996). Characterizing reference locality in the WWW. In Proc. 4th Internat. Conf. Parallel Distributed Inf. Systems, IEEE Computer Society, Washington, DC, pp. 92107.
[2] Asmussen, S., Henriksen, L. F. and Klüppelberg, C. (1994). Large claims approximations for risk processes in a Markovian environment. Stoch. Process. Appl. 54, 2943.
[3] Bentley, J. L. and McGeoch, C. C. (1985). Amortized analyses of self-organizing sequential search heuristics. Commun. Assoc. Comput. Mach. 28, 404411.
[4] Borodin, A. and El-Yaniv, R. (1998). Online Computation and Competitive Analysis. Cambridge University Press.
[5] Breslau, L., Cao, P., Fan, L., Phillips, G. and Shenker, S. (1999). Web caching and Zipf-like distributions: evidence and implications. In Proc. INFOCOM '99, Vol. 1 (New York, March 1999), pp. 126134.
[6] Dembo, A. and Zeitouni, O. (1993). Large Deviations Techniques and Applications. Jones and Bartlett, Boston, MA.
[7] Fill, J. A. (1996). An exact formula for the move-to-front rule for self-organizing lists. J. Theoret. Prob. 9, 113160.
[8] Fill, J. A. and Holst, L. (1996). On the distribution of search cost for the move-to-front rule. Random Structures Algorithms 8, 179186.
[9] Flajolet, P., Gardy, D. and Thimonier, L. (1992). Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl. Math. 39, 207229.
[10] Jelenković, P. R. (1999). Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities. Ann. Appl. Prob. 9, 430464.
[11] Jelenković, P. R. and Lazar, A. A. (1998). Subexponential asymptotics of a Markov-modulated random walk with queueing applications. J. Appl. Prob. 35, 325347.
[12] Jelenković, P. R. and Radovanović, A. (2003.). Asymptotic insensitivity of least-recently-used caching to statistical dependency. In Proc. INFOCOM 2003, Vol. 1 (San Francisco, CA, March–April 2003), pp. 438447.
[13] Jelenković, P. R. and Radovanović, A. (2004). Least-recently-used caching with dependent requests. Theoret. Comput. Sci. 326, 293327.
[14] Jelenković, P. R. and Radovanović, A. (2004). Optimizing LRU caching for variable document sizes. Combinatorics Prob. Comput. 13, 627643.
[15] Sleator, D. D. and Tarjan, R. E. (1985). Self-adjusting binary search trees. J. Assoc. Comput. Mach. 32, 652686.
[16] Young, N. E. (2000). On-line paging against adversarially biased random inputs. J. Algorithms 37, 218235.

Keywords

MSC classification

Critical sizing of LRU caches with dependent requests

  • Predrag R. Jelenković (a1), Ana Radovanović (a2) and Mark S. Squillante (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.