KJCKorea
Journal Central

@article{ART001924539},
author={Youngil Cho and Lee Sang Jeong},
title={Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency},
journal={Journal of Knowledge Information Technology and Systems},
issn={1975-7700},
year={2014},
volume={9},
number={5},
pages={589-598}

TY - JOUR
AU - Youngil Cho
AU - Lee Sang Jeong
TI - Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency
JO - Journal of Knowledge Information Technology and Systems
PY - 2014
VL - 9
IS - 5
PB - Korea Knowledge Information Technology Society
SP - 589
EP - 598
SN - 1975-7700
AB - Modern processors have large on-chip caches to mitigate off-chip memory latency. The Least Recently Used(LRU) replacement policy represents the cache blocks in a set as LRU stack. This policy picks the LRU block as the replacement candidate. In most condition, it can accomplish the work well, but for some memory-intensive workload it can not provide a long enough access history for a given cache size and associativity. Also in some workload, the majority of lines go through the cache space without making any sense. Cache performance can be improved if a long range of access history can be held so that some period of records can contribute to cache hits. In this paper, we propose an Adaptive Set-division Replacement Policy(ASRP) for effective cache management. In ASRP policy, the set of the last-level cache is divided into several subsets, only one subset is activated when replacement happens and the replacement area is limited to this subset using LRU policy. The cache misses are counted when a certain subset is activated. When the miss-count exceeds a threshold, the next subset is activated. So the threshold can indirectly decide the range of access history through the last-level cache. We use a sample method to dynamically determine the threshold for different workloads and different run-time phases of a certain workload. The experiment results show that ASRP reduces the average MPKI of the baseline 1MB 16-way L3 cache by 4.6%.
KW - cache replacement policies;cache hits;ASRP;LRU policy;access history
DO -
UR -
ER -

Youngil Cho and Lee Sang Jeong. (2014). Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency. Journal of Knowledge Information Technology and Systems, 9(5), 589-598.

Youngil Cho and Lee Sang Jeong. 2014, "Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency", Journal of Knowledge Information Technology and Systems, vol.9, no.5 pp.589-598.

Youngil Cho, Lee Sang Jeong "Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency" Journal of Knowledge Information Technology and Systems 9.5 pp.589-598 (2014) : 589.

Youngil Cho, Lee Sang Jeong. Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency. 2014; 9(5), 589-598.

Youngil Cho and Lee Sang Jeong. "Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency" Journal of Knowledge Information Technology and Systems 9, no.5 (2014) : 589-598.

Youngil Cho; Lee Sang Jeong. Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency. Journal of Knowledge Information Technology and Systems, 9(5), 589-598.

Youngil Cho; Lee Sang Jeong. Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency. Journal of Knowledge Information Technology and Systems. 2014; 9(5) 589-598.

Youngil Cho, Lee Sang Jeong. Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency. 2014; 9(5), 589-598.

Youngil Cho and Lee Sang Jeong. "Adaptive Set-Division Replacement Policy for Increasing Cache Efficiency" Journal of Knowledge Information Technology and Systems 9, no.5 (2014) : 589-598.