BCD: To Achieve the Theoretical Optimum of Spatial Locality Based Cache Replacement Algorithm

Studying blocks behavior during their lifetime in cache can provide useful information to reduce the miss rate and therefore improve processor performance. According to this rationale, the peLIFO replacement algorithm [M. Chaudhuri, Proc. Micro'09, New York, 12–16 December, 2009, pp. 401–412], which learns dynamically the number of cache ways required to satisfy short-term reuses preserving the remaining ways for long-term reuses, has been recently proposed. In this paper, we propose several changes to the original peLIFO policy in order to reduce the implementation complexity involved, and we extend the algorithm to a shared-cache environment considering dynamic information about threads behavior to improve cache efficiency. Experimental results confirm that our simplification techniques reduce the required hardware with a negligible performance penalty, while the best of our thread-aware extension proposals reduces average CPI by 8.7% and 15.2% on average compared to the original peLIFO and LRU respectively for a set of 43 multi-programmed workloads on an 8 MB 16-way set associative shared L2 cache.

Download Full-text

An optimal cache replacement algorithm for Internet systems

Proceedings of 22nd Annual Conference on Local Computer Networks ◽

10.1109/lcn.1997.630987 ◽

2002 ◽

Cited By ~ 6

Author(s):

K.H. Yeung ◽

K.W. Ng

Keyword(s):

Cache Replacement ◽

Replacement Algorithm

Download Full-text

A Server Cache Size Aware Cache Replacement Algorithm for Block Level Network Storage

2011 Tenth International Symposium on Autonomous Decentralized Systems ◽

10.1109/isads.2011.80 ◽

2011 ◽

Cited By ~ 6

Author(s):

Yusuke Nagasako ◽

Saneyasu Yamaguchi

Keyword(s):

Network Storage ◽

Cache Replacement ◽

Cache Size ◽

Replacement Algorithm ◽

Block Level

Download Full-text

DYNAMIC CONTROL METHODS OF CACHE LINES REPLACEMENT POLICY

Vestnik komp iuternykh i informatsionnykh tekhnologii ◽

10.14489/vkit.2020.05.pp.049-056 ◽

2020 ◽

pp. 49-56

Author(s):

A. V. Vishnekov ◽

E. M. Ivanova

Keyword(s):

Decision Making ◽

Dynamic Control ◽

Replacement Policy ◽

Cache Memory ◽

Cache Replacement ◽

Program Code ◽

Methods Development ◽

Replacement Algorithm ◽

Type Definition ◽

Replacement Algorithms

The paper investigates the issues of increasing the performance of computing systems by improving the efficiency of cache memory, analyzes the efficiency indicators of replacement algorithms. We show the necessity of creation of automated or automatic means for cache memory tuning in the current conditions of program code execution, namely a dynamic cache replacement algorithms control by replacement of the current replacement algorithm by more effective one in current computation conditions. Methods development for caching policy control based on the program type definition: cyclic, sequential, locally-point, mixed. We suggest the procedure for selecting an effective replacement algorithm by support decision-making methods based on the current statistics of caching parameters. The paper gives the analysis of existing cache replacement algorithms. We propose a decision-making procedure for selecting an effective cache replacement algorithm based on the methods of ranking alternatives, preferences and hierarchy analysis. The critical number of cache hits, the average time of data query execution, the average cache latency are selected as indicators of initiation for the swapping procedure for the current replacement algorithm. The main advantage of the proposed approach is its universality. This approach assumes an adaptive decision-making procedure for the effective replacement algorithm selecting. The procedure allows the criteria variability for evaluating the replacement algorithms, its’ efficiency, and their preference for different types of program code. The dynamic swapping of the replacement algorithm with a more efficient one during the program execution improves the performance of the computer system.

Download Full-text