Using Belady's algorithm for improved cache replacement
-
Updated
Apr 25, 2019 - C++
#
belady
Here are 6 public repositories matching this topic...
Trace-driven cache memory simulator with LRU, MRU, RR and Belady replacement policies.
simulator cache lru cache-storage lru-cache cache-simulator mru cache-replacement mru-cache most-recently-used cache-memory least-recently-used belady cache-simulation
-
Updated
Dec 22, 2023 - C#
A 3-level cache simulator for SPEC traces with various inclusion and block replacement policies
-
Updated
Sep 1, 2019 - C++
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.
python machine-learning lru xgboost lightgbm mfu system-design lfu catboost belady zipf-distribution cache-system
-
Updated
Jul 27, 2025 - Python
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.
c machine-learning cache lru perceptron online-learning cache-simulator memory-hierarchy cache-replacement lfu machine-learning-systems belady set-associative-cache cache-replacement-policies systems-ml spec-cpu-2006 crc2-computer-architecture
-
Updated
Apr 23, 2026 - C
Improve this page
Add a description, image, and links to the belady topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the belady topic, visit your repo's landing page and select "manage topics."