Cache Replacement Policies for Modern Multicore Systems: From LRU to  Mockingjay

Purnendu Das, Bishwa Ranjan Roy

Cache Replacement Policies for Modern Multicore Systems: From LRU to Mockingjay

Authors

Purnendu Das, Bishwa Ranjan Roy

Keywords:

cache replacement, multicore processors, last-level cache, LRU, RRIP, dead block prediction, Hawkeye, Mockingjay

Abstract

The replacement policy of a last-level cache decides which resident block issacrificed when a miss must be filled. That apparently local choice has system-widconsequences in a modern multicore processor: it changes memory-level parallelism, DRAM traffic, prefetch usefulness, interference among applications, throughput, and
fairness. This survey organizes the development of processor

References

[1] L. A. Belady, “A study of replacement algorithms for a virtual-storage computer,” IBM Systems Journal, vol. 5, no. 2, pp. 78–101, 1966.

[2] R. L. Mattson, J. Gecsei, D. R. Slutz, and I. L. Traiger, “Evaluation techniques for storage hierarchies,” IBM Systems Journal, vol. 9, no. 2, pp. 78–117, 1970.

Downloads

Published

2024-06-20

How to Cite

Purnendu Das, Bishwa Ranjan Roy. (2024). Cache Replacement Policies for Modern Multicore Systems: From LRU to Mockingjay. Journal of Computational Analysis and Applications (JoCAAA), 33(06), 4228–4245. Retrieved from https://www.eudoxuspress.com/index.php/pub/article/view/5833