Transient and steady-state regime of a family of list-based cache replacement algorithms

被引:0
作者
Nicolas Gast
Benny Van Houdt
机构
[1] Inria,Department of Mathematics and Computer Science
[2] Univ. Grenoble Alpes,undefined
[3] CNRS,undefined
[4] LIG,undefined
[5] University of Antwerp - iMinds,undefined
来源
Queueing Systems | 2016年 / 83卷
关键词
Cache replacement policies; Independent reference model; Storage management; Self-organizing lists; Miss ratio; 68M20; 68W99; 68P20; 60J20;
D O I
暂无
中图分类号
学科分类号
摘要
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 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 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 go 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 is 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.
引用
收藏
页码:293 / 328
页数:35
相关论文
共 63 条
[1]  
Aven OI(1976)Some results on distribution-free analysis of paging algorithms IEEE Trans. Comput. 25 737-745
[2]  
Boguslavsky LB(1983)Two-level replacement decisions in paging stores IEEE Trans. Comput. 32 1151-1159
[3]  
Kogan YA(2008)A class of mean field interaction models for computer and communication systems Perform. Eval. 65 823-838
[4]  
Babaoglu O(2014)Exact analysis of TTL cache networks Perform. Eval. 79 2-23
[5]  
Ferrari D(2002)Hierarchical web caching systems: modeling, design and experimental results IEEE J. Sel. A. Commun. 20 1305-1314
[6]  
Benaïm M(1990)An approximate analysis of the LRU and FIFO buffer replacement schemes SIGMETRICS Perform. Eval. Rev. 18 143-152
[7]  
Le Boudec J(1978)Efficient calculation of expected miss ratios in the independent reference model SIAM J. Comput. 7 288-296
[8]  
Berger DS(1971)Correlation inequalities on some partially ordered sets Commun. Math. Phys. 22 89-103
[9]  
Gland P(2014)Performance evaluation of the random replacement policy for networks of caches Perform. Eval. 72 16-36
[10]  
Singla S(1973)A unified approach to the evaluation of a class of replacement algorithms IEEE Trans. Comput. 22 611-618