@article{ART001984992},
author={Lee Sang Jeong and Youngil Cho},
title={A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2015},
volume={10},
number={2},
pages={145-152}
TY - JOUR
AU - Lee Sang Jeong
AU - Youngil Cho
TI - A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors
JO - Journal of Knowledge Information Technology and Systems
PY - 2015
VL - 10
IS - 2
PB - Korea Knowledge Information Technology Society
SP - 145
EP - 152
SN - 1975-7700
AB - 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.
KW - Replacement policies;LRU;Recency;Frequency;Thrashing;Last level cache;Victims
DO -
UR -
ER -
Lee Sang Jeong and Youngil Cho. (2015). A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors. Journal of Knowledge Information Technology and Systems, 10(2), 145-152.
Lee Sang Jeong and Youngil Cho. 2015, "A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors", Journal of Knowledge Information Technology and Systems, vol.10, no.2 pp.145-152.
Lee Sang Jeong, Youngil Cho "A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors" Journal of Knowledge Information Technology and Systems 10.2 pp.145-152 (2015) : 145.
Lee Sang Jeong, Youngil Cho. A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors. 2015; 10(2), 145-152.
Lee Sang Jeong and Youngil Cho. "A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors" Journal of Knowledge Information Technology and Systems 10, no.2 (2015) : 145-152.
Lee Sang Jeong; Youngil Cho. A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors. Journal of Knowledge Information Technology and Systems, 10(2), 145-152.
Lee Sang Jeong; Youngil Cho. A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors. Journal of Knowledge Information Technology and Systems. 2015; 10(2) 145-152.
Lee Sang Jeong, Youngil Cho. A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors. 2015; 10(2), 145-152.
Lee Sang Jeong and Youngil Cho. "A Cache Replacement Policy for Improving the Performance of Last Level Cache in Processors" Journal of Knowledge Information Technology and Systems 10, no.2 (2015) : 145-152.
