https://github.com/kavicastelo/advanced-cache-design
A collection of advanced cache design algorithms including LRU, LFU, ARC, TinyLFU, Count-Min Sketch, and Segmented LRU, implemented in TypeScript.
https://github.com/kavicastelo/advanced-cache-design
arc-cache cache-design count-min-sketch lfu-cache lru-cache slru-cache system-design tinylfu
Last synced: 5 months ago
JSON representation
A collection of advanced cache design algorithms including LRU, LFU, ARC, TinyLFU, Count-Min Sketch, and Segmented LRU, implemented in TypeScript.
- Host: GitHub
- URL: https://github.com/kavicastelo/advanced-cache-design
- Owner: kavicastelo
- License: mit
- Created: 2025-11-18T17:18:13.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-11-18T18:17:04.000Z (7 months ago)
- Last Synced: 2025-11-18T19:17:26.600Z (7 months ago)
- Topics: arc-cache, cache-design, count-min-sketch, lfu-cache, lru-cache, slru-cache, system-design, tinylfu
- Language: JavaScript
- Homepage:
- Size: 20.5 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Advanced Cache Design Algorithms (LRU, LFU, ARC, TinyLFU, SLRU, CMS)
This repository contains **production-quality, educational implementations** of modern cache eviction and admission algorithms used in systems such as:
- Redis
- ZFS
- Cloudflare CDN
- YouTube backend services
- Google’s Caffeine Cache
- OS kernel memory managers
These implementations are written in **TypeScript**, focusing on clarity and correctness.
---
## 🚀 Included Algorithms
### ✔️ LRU (Least Recently Used)
Classical O(1) LRU using a doubly linked list + hash map.
### ✔️ LFU (Least Frequently Used)
Full LFU with frequency lists and O(1) updates.
### ✔️ ARC (Adaptive Replacement Cache)
Self-tuning hybrid of recency and frequency.
### ✔️ TinyLFU (Admission Policy)
Modern frequency-based admission algorithm used by Google Caffeine.
### ✔️ SLRU (Segmented Least Recently Used)
Two-tier LRU that protects hot entries from eviction.
### ✔️ CMS (Count-Min Sketch)
Probabilistic frequency estimator (used by huge-scale caches).
---
## 📦 Installation
```bash
git clone https://github.com/kavicastelo/advanced-cache-design.git
cd advanced-cache-design
npm install
```
---
## ▶️ Running Examples
```bash
npm run build
node dist/examples/test-lru.js
```
Want scripts for all algorithms? Just run:
```bash
node dist/examples/test-*.js
```
---
## 📁 Directory Overview
```text
src/
lru/ → LRU cache implementation
lfu/ → LFU cache implementation
arc/ → ARC hybrid cache
cms/ → Count–Min Sketch
tiny-lfu/ → TinyLFU admission
slru/ → Segmented LRU eviction
examples/ → Demo scripts
```
---
## 🧰 Technologies Used
- TypeScript
- Node.js
- Modern data structure design
- Systems design best practices
---
## 📝 License
[MIT](LICENSE) License – Free to use and modify.