一种基于伪LRU的新型共享Cache划分机制  

A Novel Pseudo-LRU Based Shared Cache Partitioning Mechanism

作　　者：倪亚路[1] 周晓方[1] 

机构地区：[1]复旦大学专用集成电路与系统国家重点实验室,上海201203

出　　处：《电子学报》2013年第4期681-684,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60876016)

摘　　要：本文提出了一种基于伪LRU方法的新型共享Cache动态划分策略PLRU-SCP.本文提出的划分策略在分析电路中给出了基于二叉树的新型分析方法,在划分电路中使用了一种非遍历的划分算法.并提出了一种新型共享Cache结构.本文提出的新型划分策略比基于LRU方法的不划分共享Cache策略和效用最优的划分策略的性能分别提高了11.05%和8.66%.A novel dynamic cache partitioning strategy based on pseudo-LRU policies（PLRU-SCP）is proposed in this paper. The analysis circuit for the proposed strategy makes use of a new statistical method based on binary tree,and the partitioning circuit employs the non-exhaustive algorithm. Besides, we presents a novel shared cache structure. According to simulation results, the pro- posed shared cache with PLRU-SCP outperforms those without the partitioning strategy using LRU policy（LRU-NP）by 11.05 % on average performance,and has a better performance than those with the utility-based partitioning strategy using LRU method（LRU- UCP） by 8.66%.

关 键 词：共享CACHE 伪LRU替换方法 二叉树分析 非遍历划分算法 

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