HackerTube.runGood videos, with context.![Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017](https://i.ytimg.com/vi/F8sZRBdmqc0/hqdefault.jpg)
Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
About this video
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.
Why it appears in the archive
Recommended in cache-algorithm threads as a fun, informative walk through caching strategies and ARC.
AI-generated summary and labels from the source dataset; verify important details against the video. Source & credits.
From the Hacker News discussion
Bryan Cantrill does a pretty good survey of caching strategies in the intro to this Papers We Love talk on the ARC in ZFS. [VIDEO]
Read original comment ↗Might I also recommend: Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017 [VIDEO]
Read original comment ↗> 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. [VIDEO] is a fun watch on the topic.
Read original comment ↗The author calls ARC autotuning “opaque” which surprised me given a well regarded paper has been published on it: [LINK] [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.
Read original comment ↗