DocumentCode
1925714
Title
Cache Promotion Policy Using Re-reference Interval Prediction
Author
Jia, Gangyong ; Li, Xi ; Wang, Chao ; Zhou, Xuehai ; Zhu, Zongwei
Author_Institution
Dept. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China (USTC), Hefei, China
fYear
2012
fDate
24-28 Sept. 2012
Firstpage
534
Lastpage
537
Abstract
The last-level cache (LLC) mitigates the long latencies of memory access in today´s chip multi-core processor (CMP). The promotion policy in the LLC largely affects cache efficiency, while an inappropriate promotion policy may lead useless blocks to remain in the cache longer than necessary, in turn result into inefficiency. Currently state-of-the-art promotion policies are unaware of the re-reference interval of cache accesses. Applications that exhibit a long re-reference interval perform poorly with these promotion policies. In this paper, we propose a promotion policy that uses re-reference interval prediction (RRIP) information. Such technique requires minor hardware modification over the least-recently-used (LRU) replacement policy. Our evaluation shows that RRIP improves IPCsum by 2.58%, Weighted Speedup by 3.54% and IPCnorm_hmean by 6.2% on average over single-step promotion policy.
Keywords
cache storage; microprocessor chips; multiprocessing systems; CMP; LLC; LRU; RRIP; cache accesses; cache promotion policy; chip multicore processor; hardware modification; last-level cache; least-recently-used replacement policy; memory access latencies; rereference interval prediction; single-step promotion policy; weighted speedup; Art; Benchmark testing; Hardware; Measurement; Multicore processing; Throughput; USA Councils; CMP; LLC; LRU; MRU; promotion policy; re-reference interval; single-step;
fLanguage
English
Publisher
ieee
Conference_Titel
Cluster Computing (CLUSTER), 2012 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4673-2422-9
Type
conf
DOI
10.1109/CLUSTER.2012.32
Filename
6337817
Link To Document