Using Belady's algorithm for improved cache replacement
-
Updated
Apr 25, 2019 - C++
Using Belady's algorithm for improved cache replacement
Trace-driven cache memory simulator with LRU, MRU, RR and Belady replacement policies.
A 3-level cache simulator for SPEC traces with various inclusion and block replacement policies
A smart caching system that combines traditional strategies (LRU, LFU, MFU) with machine learning to approximate Belady’s optimal replacement policy. This project generates skewed access patterns, labels them using optimal logic, trains multiple ML models, and integrates the best into a custom predictive cache.
Add a description, image, and links to the belady topic page so that developers can more easily learn about it.
To associate your repository with the belady topic, visit your repo's landing page and select "manage topics."