基于修正LRU的压缩Cache替换策略  

Replacement Policy for Compressed Cache Based on Modified LRU

作　　者：田新华[1] 欧国东[1] 张民选[1] 

机构地区：[1]国防科技大学计算机学院,长沙410073

出　　处：《计算机工程》2008年第18期7-9,16,共4页Computer Engineering

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

摘　　要：以优化压缩cache的替换策略为目标,提出一种优化的基于修正LRU的压缩cache替换策略MLRU-C。MLRU-C策略能利用压缩cache中额外的tag资源,形成影子tag机制来探测并修正LRU替换策略的错误替换决策,从而优化压缩cache替换策略的性能。实验结果表明,与传统LRU替换策略相比,MLRU-C平均能降低L2压缩cache失效率12.3%。This paper proposes an improved compressed cache replacement policy Modified LRU Replacement Policy for Compressed Cache（MLRU-C） based on modified Least recently Used（LRU） policy for improving compressed cache replacement policy. MLRU-C can use the extra tag in compressed cache to construct shadow ta.g mechanism, which can detect, predict, and correct bad replacement decisions made by LRU policy so as to improve performance of compressed cache replacement policy. Experimental results show MLRU-C can decrease L2 compressed cache miss rate by 12.3% compared with conventional LRU replacement policy.

关 键 词：影子tag机制 压缩cache 替换策略 

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