lfu.pdf
dhruvbird.com · 2,359 words · saved by 1 readers
N/A
An O(1) algorithm for implementing the LFU cache eviction scheme Prof. Ketan Shah Anirban Mitra Dhruv Matani August 16, 2010 Abstract Cache eviction algorithms are used widely in operating systems, databases and other systems that use caches to speed up execution by caching data that is used by the application. There are many policies such as MRU (Most Recently Used), MFU (Most Frequently Used), LRU (Least Re- cently Used) and LFU (Least Frequently Used) which each have their advantages…
saved by
related reading
- Analyzing the codebase of Caffeine: a high performance caching library | Adri’s Blogadriacabeza.github.io
- LRU Cache: How It Works (Data Structure & Code) | Interview Cakeinterviewcake.com
- A very concrete explanation of how a cache worksparksb.github.io
- What Every Programmer Should Know About Memorypeople.freebsd.org
- p197-wang.pdfvldb.org
- Efficient Detection of Exchangeable Factors in Factor Graphsarxiv.org
- What Every Programmer Should Know About Memoryakkadia.org
- Competitive Programmer's Handbookcses.fi
- Introduction to Locality-Sensitive Hashingtylerneylon.com
- CMSY9people.csail.mit.edu
- Buffer cache | CS 162 Project 3cs162.org
- Chain Replication for Supporting High Throughput and Availabilitycs.cornell.edu