3 HN users recommended this talk3 months2019–2024score 3
Years with an HN recommendation, 2007–2026
Recommended in cache-algorithm threads as a fun, informative walk through caching strategies and ARC.
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.
“Bryan Cantrill does a pretty good survey of caching strategies in the intro” (HN, 2021)
> 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.
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.
Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.
![Frame from Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017](https://i.ytimg.com/vi/F8sZRBdmqc0/hq2.jpg)
Plays via YouTube's privacy-enhanced embed
4 Hacker News comments
From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.
Citations, criticism and jokes