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
This repository contains a set-associative cache simulator in C with four eviction policies: LRU, LFU, Bélády's OPT, and an online perceptron-based policy that scores by recency, frequency, and per-PC weights updated from a circular eviction history to explore whether a lightweight ML model can approximate OPT at runtime with no offline training.
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.
Which Redis eviction policy keeps the most useful data, at what memory budget, for what shape of traffic - measured against Belady's optimal, the best any policy could have done
To associate your repository with the belady topic, visit your repo's landing page and select "manage topics."