발간년도 : [2015]
| 논문정보 |
|
| 논문명(한글) |
[Vol.10, No.2] A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors |
|
| 논문투고자 |
Sang-Jeong Lee, Young-Il Cho |
|
| 논문내용 |
Reduction in cache miss rates continues to be an important issue in processor design, especially at the last level cache(LLC). The Least Recently Used(LRU) replacement policy has been widely adapted in processors for the past decades. The LRU replacement policy represents the cache blocks in a set as LRU stack. So, it only use the recency information. And it is expensive to implement in hardware. Also in some workload, it raises the thrashing, i.e., blocks with high reuse evicting each other from the cache. We propose an new replacement policy to solve problems of LRU replacement policy. In the proposed policy, a incoming block is inserted at the bottom of the set. To exploit the frequency information, a hit block exchanges its position with its adjacent block above in the set. A victim block can be chosen from bottom. Selecting the bottom block as the victim makes the proposed policy to protect the cache from polluting by less frequently used blocks. It also proposes to divide the blocks in a cache set into groups to resolve the thrashing. The victim block is selected alternately from each group. The proposed policy reduces the average MPKI(Miss Per Kilo Instructions) of the baseline 1MB 16-way LLC cache using LRU replacement policy by 12.9%. It reduces the storage requirement by 47% compared to LRU replacement policy. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
