발간년도 : [2017]
| 논문정보 |
|
| 논문명(한글) |
[Vol.12, No.5] A Filtering Scheme to Improve the performance of Last Level Cache |
|
| 논문투고자 |
Young-Il Cho |
|
| 논문내용 |
The last level cache(LLC) is commonly managed using LRU policy. However, LRU has a high overhead cost of moving cache lines into the most recently used position whenever a cache line is accessed. Also, LRU is prone to cache pollution when a sequence of single-use memory accesses that are larger than the cache size is fetched from memory. Cache performance and efficiency can be improved if some subset of these reuse lines can reside in the cache longer. Previous schemes approach this by bypassing never reused lines(0-reused lines). But, sometimes they deliver no benefit due to the lack of never reused lines. This paper proposes a new mechanism that filters out not only 0-reused lines but also 1-reused lines and accurately predicts 0/1-reused lines from incoming lines. Filtering of 0/1-reused lines provides more opportunities to fit the working set into cache size. Our proposed scheme is evaluated using a simulation environment where its effectiveness and performance-improvement capabilities are demonstrated. We present experimental results showing miss rate and IPC(Instruction Per Cycle) comparison of the proposed scheme and OBM(Optimal Bypass Monitor) against LRU for SPEC CPU2006 benchmarks. The result shows that the proposed scheme and OBM can improve IPC by an average of 20.1% and 14.4%, respectively. And the proposed scheme reduces the miss rate by 20.6% compared to LRU. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
