hesela.devTinyLFU
TinyLFU is a cache admission policy that compares approximate recent access frequencies of a candidate and an eviction victim.
Periodic aging reduces the influence of old requests. Estimates cover more than resident entries and are not an exact frequency histogram. [1]
Window TinyLFU combines a resident recency window with frequency-based admission to a main cache. The window lets new bursts accumulate accesses before the comparison. Window sizing is implementation-specific. [2]
Relations
- related
- cache-admission, cache-pollution, lru-replacement, bloom-filter
Citations
- Einziger, Friedman and Manes. TinyLFU: A Highly Efficient Cache Admission Policy. arXiv:1512.00727v2 (2015), sections 3-5.
- Caffeine project. Efficiency: Window TinyLFU and adaptive admission-window sizing.
Sources & caveats
- The TinyLFU citation is the 2015 v2 preprint, not the later journal version. It does not establish retail SSD firmware behavior. [1]