Adaptive Insertion and Promotion Policies Based on Least Recently Used Replacement

Wenbing JIN  Xuanya LI  Yanyong YU  Yongzhi WANG  

IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.1   pp.124-128
Publication Date: 2013/01/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.124
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Computer System
last-level cache,  replacement,  insertion,  promotion,  thrashing,  

Full Text: PDF(1MB)>>
Buy this Article

To improve Last-Level Cache (LLC) management, numerous approaches have been proposed requiring additional hardware budget and increased overhead. A number of these approaches even change the organization of the existing cache design. In this letter, we propose Adaptive Insertion and Promotion (AIP) policies based on Least Recently Used (LRU) replacement. AIP dynamically inserts a missed line in the middle of the cache list and promotes a reused line several steps left, realizing the combination of LRU and LFU policies deliberately under a single unified scheme. As a result, it benefits workloads with high locality as well as with many frequently reused lines. Most importantly, AIP requires no additional hardware other than a typical LRU list, thus it can be easily integrated into the existing hardware with minimal changes. Other issues around LLC such as scans, thrashing and dead lines are all explored in our study. Experimental results on the gem5 simulator with SPEC CUP2006 benchmarks indicate that AIP outperforms LRU replacement policy by an average of 5.8% on the misses per thousand instructions metric.