基于梯度的低功耗Cache划分算法  

The Gradient-based Low-power Cache Partitioning Algorithm

作　　者：闫萌萌[1] 张盛兵[1] 

机构地区：[1]西北工业大学计算机学院,陕西西安710129

出　　处：《微电子学与计算机》2013年第8期23-27,共5页Microelectronics & Computer

摘　　要：在GPA(Gradient-based Partition Algorithm)算法的基础上提出一种对多核系统的共享L3cache进行划分的方法GLPCPA(Gradient-based Low-Power Cache Partition Algorithm),该方法通过监测cache行为的局部特性和全局特性的方法打开或关闭一些cache路对cache的容量进行动态调整,在保持性能的同时降低功耗.该方法使用循环OBL(Robin One-Bit LRU)替换算法,其硬件开销小且性能高.仿真实验表明GLPCPA算法能将共享L3 Cache的总功耗减少20%以上,最多可以减少40%,但性能下降不超过10%.而且GLPCPA具有健壮性、可扩展性以及稳定性,并能够和现有的cache设计很好地结合在一起.The mechanism called GLPCPA that based on the GPA（Gradient-based Partition Algorithm） has introduced to partition the shared L3 cache in multi-processor systems.This mechanism resizes the cache dynamically through observing the local and global behavior of the cache to active or inactive a way.So the system could maintain the high performance while it is reducing the power consumption.Robin OBL（One-Bit LRU） replacement policy is used because of its low-cost and high performance.Simulation results show that GLPCPA reduces more than 20% power consumption of the L3 cache,and the best result could reach 40%.However,the performance degradation is less than 10%.GLPCPA has the robustness,scalability and stability,and it is integrated well with most existing cache designs.

关 键 词：GPA算法 CACHE划分 低功耗 循环OBL替换算法 

分 类 号：TN402[电子电信—微电子学与固体电子学]