Partition-Based Cache Replacement to Manage Shared L2 Caches

The Least recently used （LRU） replacement has been widely employed by on-chip shared caches. With the increase of cache associativity, the performance gap between LRU and theoretical optimal replacement algorithm is significant, motivating us to design alternative replacement algorithms to improve c...

Full description

Saved in:
Bibliographic Details
Published in:电子学报：英文版 2014-07, Vol.23 (3), p.464-467
Main Author: FANG Juan WANG Jing LI Chengyan YAO Zhicheng KE Weimao
Format: Article
Language:English
Subjects:
PCR方法
共享缓存
分区
替换算法
管理
缓存性能
缓存替换
高速缓存
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Least recently used （LRU） replacement has been widely employed by on-chip shared caches. With the increase of cache associativity, the performance gap between LRU and theoretical optimal replacement algorithm is significant, motivating us to design alternative replacement algorithms to improve cache performance. We propose a Partltlon-based cache replace- ment （PCR） algorithm to manage multi-core shared L2 caches. PCR takes into consideration recency and fre- quency information of cache access, and cache resource interference among multiple competing applications. PCR is effective to flter out the less frequently reused blocks through a dynamic insertion/promotlon policy based on the target partitions~ and ensures that some fraction of the working set is retained in the cache to contribute to more hits. Our evaluation shows that PCR improves performance of an 8-core system by an average of 11.3% over LRU-based cache.
ISSN:1022-4653