基于IRR信息的改进ARC算法  

An IRR-based improved ARC algorithm

作　　者：汤茂杰[1] 赵鹏[1] 王瑀屏[1] 

机构地区：[1]清华大学计算机科学与技术系

出　　处：《中国科技论文》2014年第4期425-428,共4页China Sciencepaper

基　　金：国家自然科学基金资助项目(61103020)

摘　　要：缓存是增强计算机整体性能的一项重要技术,缓存替换算法作为核心技术尤为重要。通过深入研究多种数据访问模式下ARC(adaptive replacement cache)算法的性能,总结出ARC算法性能较差的数据访问模式及其原因。针对发现的不足提出了一种改进的缓存替换算法,该算法通过引入IRR(inter reference recency)信息,提高了弱局部性访问模式下的缓存命中率,改善了ARC算法对不同数据访问模式的适应性。仿真实验结果表明,改进后的算法提升了应对弱局部性访问模式的能力,增强了算法的灵活性。Cache is an important technology to improve the overall performance of computers.As its core technology,more impor-tance is attached to cache replacement algorithm.Various data access patterns have been thoroughly studied,and the patterns that ARC （adaptive replacement cache）algorithm handles poorly and its cause are summed up.According to the weakness,an improved cache replacement algorithm is proposed.By introducing IRR （inter reference recency）information,the new algorithm improves cache hit rate of weak locality access pattern and makes ARC algorithm more adaptive.The simulation result shows that this algorithm can improve the ability to handle weak locality access pattern and enhance the flexibility of ARC algorithm.

关 键 词：缓存 缓存替换算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP333[自动化与计算机技术—计算机科学与技术]