Journal article Open Access

Machine Learning-Based Cache Replacement Policies: A Survey

Pratheeksha P; Revathi SA

Sponsor(s)
Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP)

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.

Files (343.2 kB)
Name Size
F29070810621.pdf
md5:8b7810f4d98f1775aeaa842adca93b72
343.2 kB Download
36
10
views
downloads
Views 36
Downloads 10
Data volume 3.4 MB
Unique views 22
Unique downloads 8

Share

Cite as