Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017 on HackerTube: recommended by 3 Hacker News commenters across 3 separate months, 2019–2024.
talk · intermediate · evergreen
Bryan Cantrill presents the ARC (Adaptive Replacement Cache) paper by Megiddo and Modha at Papers We Love. He opens with a survey of caching strategies before digging into the self-tuning LRU/MFU design.
Recommended in cache-algorithm threads as a fun, informative walk through caching strategies and ARC.
“Bryan Cantrill does a pretty good survey of caching strategies in the intro”
4 Hacker News comments link this video. Each one links back to its thread.
> it seemed natural to have a set of generations for items that have only been seen once, and then another generation for things that have been more active Have you looked at ARC? It sounds similar - it is a cache split between LRU and MFU areas, where the split point changes dynamically depending on the workload. ▶ this video is a fun watch on the topic.
in “Sieve is simpler than LRU” · View on HN
Might I also recommend: Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017 ▶ this video
in “FIFO-Reinsertion is better than LRU [pdf]” · View on HN
Bryan Cantrill does a pretty good survey of caching strategies in the intro to this Papers We Love talk on the ARC in ZFS. ▶ this video
in “The Multi-Generational LRU” · View on HN
The author calls ARC autotuning “opaque” which surprised me given a well regarded paper has been published on it: [link] ▶ this video ...that said the author has been writing on the ARC for more than 10 years judging from his blog links so perhaps that paper did not answer his questions.
in “ZFS on Linux still has annoying issues with ARC size” · View on HN