Nicolas Gast
ABSTRACT
In this paper we study the performance of a family of cache replacement algorithms. The cache is decomposed into lists. Items enter the cache via the first list. An item enters the cache via the first list and jumps to the next list whenever a hit on it occurs. The classical policies FIFO, RANDOM, CLIMB and its hybrids are obtained as special cases. We present explicit expressions for the cache content distribution and miss probability under the IRM model. We develop an algorithm with a time complexity that is polynomial in the cache size and linear in the number of items to compute the exact miss probability. We introduce lower and upper bounds on the latter that can be computed in a time that is linear in the cache size times the number of items.
We further introduce a mean field model to approximate the transient behavior of the miss probability and prove that this model becomes exact as the cache size and number of items tends to infinity. We show that the set of ODEs associated to the mean field model has a unique fixed point that can be used to approximate the miss probability in case the exact computation becomes too time consuming.
Using this approximation, we provide guidelines on how to select a replacement algorithm within the family considered such that a good trade-off is achieved between the cache reactivity and its steady-state hit probability. We simulate these cache replacement algorithms on traces of real data and show that they can outperform LRU. Finally, we also disprove the well-known conjecture that the CLIMB algorithm is the optimal finite-memory replacement algorithm under the IRM model.
- O. I. Aven, L. B. Boguslavsky, and Y. A. Kogan. Some results on distribution-free analysis of paging algorithms. IEEE Transactions on Computers, 25(7):737--745, July 1976. Google Scholar
Digital Library
- O. I. Aven, E. G. Coffman, Jr., and Y. A. Kogan. Stochastic Analysis of Computer Storage. Kluwer Academic Publishers, Norwell, MA, USA, 1987. Google ScholarDigital Library
- O. Babaoglu and D. Ferrari. Two-level replacement decisions in paging stores. IEEE Trans. Comput., 32(12):1151--1159, Dec. 1983. Google ScholarDigital Library
- M. Benaím and J. Le Boudec. A class of mean field interaction models for computer and communication systems. Performance Evaluation, 65(11--12):823--838, 2008. Google ScholarDigital Library
- D. S. Berger, P. Gland, S. Singla, and F. Ciucu. Exact analysis of TTL cache networks. Performance Evaluation, 79:2--23, 2014. Google ScholarDigital Library
- J.-Y. L. Boudec. The stationary behaviour of fluid limits of reversible processes is concentrated on stationary points. arXiv:1009.5021, 2010.Google Scholar
- L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and Zipf-like distributions: Evidence and implications. In INFOCOM'99, volume 1, pages 126--134. IEEE, 1999.Google ScholarCross Ref
- H. Che, Y. Tung, and Z. Wang. Hierarchical web caching systems: modeling, design and experimental results. IEEE J.Sel. A. Commun., 20(7):1305--1314, 2002. Google ScholarDigital Library
- A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. SIGMETRICS Perform. Eval. Rev., 18(1):143--152, Apr. 1990. Google ScholarDigital Library
- R. Fagin and T. G. Price. Efficient calculation of expected miss ratios in the independent reference model. SIAM J. Comput., 7:288--296, 1978.Google ScholarDigital Library
- N. C. Fofack, P. Nain, G. Neglia, and D. Towsley. Analysis of TTL-based cache networks. In Valuetools 2012, pages 1--10. IEEE, 2012.Google Scholar
- C. M. Fortuin, P. W. Kasteleyn, and J. Ginibre. Correlation inequalities on some partially ordered sets. Communications in Mathematical Physics, 22(2):89--103, 1971.Google ScholarCross Ref
- C. Fricker, P. Robert, and J. Roberts. A versatile and accurate approximation for lru cache performance. In Proceedings of the 24th International Teletraffic Congress, ITC '12, pages 8:1--8, 2012. Google ScholarDigital Library
- M. Gallo, B. Kauffmann, L. Muscariello, A. Simonian, and C. Tanguy. Performance evaluation of the random replacement policy for networks of caches. Performance Evaluation, 72(0):16--36, 2014. Google ScholarDigital Library
- E. Gelenbe. A unified approach to the evaluation of a class of replacement algorithms. IEEE Trans. Comput., 22(6):611--618, June 1973. Google ScholarDigital Library
- J. H. Hester and D. S. Hirschberg. Self-organizing linear search. ACM Comput. Surv., 17(3):295--311, Sept. 1985. Google ScholarDigital Library
- R. Hirade and T. Osogami. Analysis of page replacement policies in the fluid limit. Oper. Res., 58:971--984, July 2010. Google ScholarDigital Library
- P. Jelenkovic. Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities. Ann. Appl. Probab., 9(2):430--464, May 1999.Google ScholarCross Ref
- S. Jiang and X. Zhang. LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance. SIGMETRICS Perform. Eval. Rev., 30(1):31--42, June 2002. Google ScholarDigital Library
- T. Johnson and D. Shasha. 2Q: A low overhead high performance buffer management replacement algorithm. In VLDB '94, pages 439--450, San Francisco, CA, USA, 1994. Google ScholarDigital Library
- J. Jung, A. W. Berger, and H. Balakrishnan. Modeling TTL-based internet caches. In INFOCOM 2003, volume 1, pages 417--426. IEEE, 2003.Google ScholarCross Ref
- W. F. King III. Analysis of demand paging algorithms. In IFIP Congress (1), pages 485--490, 1971.Google Scholar
- N. Laoutaris, H. Che, and I. Stavrakakis. The LCD interconnection of LRU caches and its analysis. Perform. Eval., 63(7):609--634, July 2006. Google ScholarDigital Library
- A. W. Marshall and I. Olkin. Inequalities: theory of majorization and its applications. Academic Press, New York, 1979.Google Scholar
- V. Martina, M. Garetto, and E. Leonardi. A unified approach to the performance analysis of caching systems. In INFOCOM 2014, pages 2040--2048, 2014.Google ScholarCross Ref
- E. J. Rosensweig, J. Kurose, and D. Towsley. Approximate models for general cache networks. In INFOCOM'10, pages 1100--1108, Piscataway, NJ, USA, 2010. IEEE Press. Google ScholarDigital Library
- D. Starobinski and D. Tse. Probabilistic methods for web caching. Perform. Eval., 46(2-3):125--137, Oct. 2001. Google ScholarDigital Library
- N. Tsukada, R. Hirade, and N. Miyoshi. Fluid limit analysis of FIFO and RR caching for independent reference models. Perform. Eval., 69(9):403--412, Sept. 2012. Google ScholarDigital Library
- J. van den Berg and A. Gandolfi. LRU is better than FIFO under the independent reference model. Journal of Applied Probability, 29(1):pp. 239--243, 1992.Google ScholarCross Ref
- J. van den Berg and D. F. Towsley. Properties of the miss ratio for a 2-level storage model with LRU or FIFO replacement strategy and independent references. IEEE Trans. Computers, 42(4):508--512, 1993. Google ScholarDigital Library
- S. Vanichpun and A. M. Makowski. Comparing strength of locality of reference -- popularity, majorization, and some folk theorems. In INFOCOM, 2004.Google ScholarCross Ref
- S. Vanichpun and A. M. Makowski. The output of a cache under the independent reference model: Where did the locality of reference go? SIGMETRICS Perform. Eval. Rev., 32(1):295--306, June 2004. Google ScholarDigital Library
- R. D. Yates. A framework for uplink power control in cellular radio systems. Selected Areas in Communications, IEEE Journal on, 13(7):1341--1347, 1995. Google ScholarDigital Library
- M. Zink, K. Suh, Y. Gu, and J. Kurose. Characteristics of YouTube network traffic at a campus network - measurements, models, and implications. Comput. Netw., 53(4):501--514, Mar. 2009. Google ScholarDigital Library
Index Terms
- Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms
Recommendations
Transient and Steady-state Regime of a Family of List-based Cache Replacement Algorithms
Performance evaluation reviewIn this paper we study the performance of a family of cache replacement algorithms. The cache is decomposed into lists. Items enter the cache via the first list. An item enters the cache via the first list and jumps to the next list whenever a hit on it ...
Transient and steady-state regime of a family of list-based cache replacement algorithms
We study the performance of a family of cache replacement algorithms. The cache is decomposed into lists. Some of these lists can be virtual in the sense that only meta-data are stored in those lists. An item enters the cache via the first list and ...
Proxy Cache Replacement Algorithms: A History-Based Approach
Accesing and circulation of Web objects has been facilitated by the design and implementation of effective caching schemes. Web caching has been integrated in prototype and commercial Web-based information systems in order to reduce the overall ...
Comments