@article{ART002581801},
author={Youngil Cho},
title={An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2020},
volume={15},
number={2},
pages={265-273},
doi={10.34163/jkits.2020.15.2.012}
TY - JOUR
AU - Youngil Cho
TI - An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count
JO - Journal of Knowledge Information Technology and Systems
PY - 2020
VL - 15
IS - 2
PB - Korea Knowledge Information Technology Society
SP - 265
EP - 273
SN - 1975-7700
AB - Caching techniques are fundamental for bridging the performance gap between components in a computer system, such as the performance of processor and memory. To get more performance out of the cache hierarchy, processors will rely on effective cache replacement policies. Variability in generational behavior of cache blocks is a key challenge for cache replacement policies that aim to identify less reused blocks as early and accurately as possible to maximize the cache efficiency. Existing processors use variants of LRU policy to determine replacement targets. But, there is a big gap between what LRU policy provides and what the optimal replacement policy provides by Belady's MIN. In this paper, we observed that the number of hits of a block is similar to the average number of hits when previously residing in the cache. This observation is used to improve the efficiency of the LLC through a low cost but effective replacement policy. With little overhead, the proposed policy is an effective replacement policy that associates a predicted hit count to a block and evicts the block to have fewer remaining hits in the future. Also, blocks that are predicted as non-reusable blocks are bypassed to improve the cache efficiency. The proposal provides a 5.8% miss reduction and a 4.8% performance improvement over baseline LRU.
KW - Cache replacement policy;LRU;Belady’s Min;Hit count;LLC
DO - 10.34163/jkits.2020.15.2.012
ER -
Youngil Cho. (2020). An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count. Journal of Knowledge Information Technology and Systems, 15(2), 265-273.
Youngil Cho. 2020, "An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count", Journal of Knowledge Information Technology and Systems, vol.15, no.2 pp.265-273. Available from: doi:10.34163/jkits.2020.15.2.012
Youngil Cho "An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count" Journal of Knowledge Information Technology and Systems 15.2 pp.265-273 (2020) : 265.
Youngil Cho. An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count. 2020; 15(2), 265-273. Available from: doi:10.34163/jkits.2020.15.2.012
Youngil Cho. "An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count" Journal of Knowledge Information Technology and Systems 15, no.2 (2020) : 265-273.doi: 10.34163/jkits.2020.15.2.012
Youngil Cho. An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count. Journal of Knowledge Information Technology and Systems, 15(2), 265-273. doi: 10.34163/jkits.2020.15.2.012
Youngil Cho. An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count. Journal of Knowledge Information Technology and Systems. 2020; 15(2) 265-273. doi: 10.34163/jkits.2020.15.2.012
Youngil Cho. An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count. 2020; 15(2), 265-273. Available from: doi:10.34163/jkits.2020.15.2.012
Youngil Cho. "An Effective Last-Level Cache Replacement and Bypass Policy Using Hit Count" Journal of Knowledge Information Technology and Systems 15, no.2 (2020) : 265-273.doi: 10.34163/jkits.2020.15.2.012
