Machine Learning-Based Cache Replacement Policies: A Survey
Pratheeksha P1, Revathi SA2
1Pratheeksha P*, Student, Department of Computer Science, RV College of Engineering, Bangalore, India.
2Revathi SA, Assistant Professor, Department of Computer Science, RV College of Engineering, Bangalore, India.
Manuscript received on May 24, 2021. Revised Manuscript received on July 19, 2021. Manuscript published on August 30, 2021. | PP: 19-22 | Volume-10 Issue-6, August 2021 | Retrieval Number: 100.1/ijeat.F29070810621 | DOI: 10.35940/ijeat.F2907.0810621
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Despite extensive developments in improving cache hit rates, designing an optimal cache replacement policy that mimics Belady’s algorithm still remains a challenging task. Existing standard static replacement policies does not adapt to the dynamic nature of memory access patterns, and the diversity of computer programs only exacerbates the problem. Several factors affect the design of a replacement policy such as hardware upgrades, memory overheads, memory access patterns, model latency, etc. The amalgamation of a fundamental concept like cache replacement with advanced machine learning algorithms provides surprising results and drives the development towards cost-effective solutions. In this paper, we review some of the machine-learning based cache replacement policies that outperformed the static heuristics.
Keywords: Belady’s algorithm, Cache Replacement, Machine Learning
Scope of the Article: Machine Learning