[Libre-soc-dev] W-TinyLFU cache admission policy

Jacob Lifshay programmerjake at gmail.com
Mon Sep 6 02:36:55 BST 2021

I found this interesting paper:

TinyLFU uses bloom filters to help approximate LFU, which, when combined
with LRU or Random, makes a pretty good caching policy.

W-TinyLFU puts a tiny (~1% size) LRU cache in-front of TinyLFU and it ended
up being the best caching policy they tested.

Those caching policies are designed for stuff like disk caching, or caching
web pages, but they are worth checking out for use as a cpu caching policy
for L2 (and maybe L1) caches.


More information about the Libre-soc-dev mailing list