Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
PapersWeLove3 HN recommenders · recommended in 3 months, 2019–2024
talk · intermediate · evergreen · 2019–2024 on HN
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.
Up next
1 mo on HNThe Mill CPU Architecture – The Compiler (10 of 13)
Mill Computing, Inc.
1 HN recommend · 2015–2023
2 mo on HNThe Mind-Blowing Machines that Stamp Millions of Metal Parts - Smarter Every Day 288
SmarterEveryDay
2 HN recommender · 2023–2025
9 mo on HNTransforming Code into Beautiful, Idiomatic Python
Next Day Video
9 HN recommender · 2014–2022
2 mo on HNClojure for Java Programmers Part 1 - Rich Hickey
ClojureTV
2 HN recommender · 2013–2022
10 mo on HNCppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon
9 HN recommender · 2018–2026
8 mo on HNThe Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Reducible
7 HN recommender · 2021–2026
9 mo on HNModern Dictionaries by Raymond Hettinger
SF Python
9 HN recommender · 2016–2025
7 mo on HNCppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
CppCon
7 HN recommender · 2014–2024
7 mo on HNCppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
CppCon
5 HN recommender · 2017–2025
6 mo on HNSorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
CppCon
7 HN recommender · 2019–2024
6 mo on HNThe Fastest Way to Board a Plane Feels Like the Slowest
CGP Grey
9 HN recommender · 2020–2023
6 mo on HN30 Weird Chess Algorithms: Elo World
suckerpinch
8 HN recommender · 2019–2026
4 comments from Hacker News
> 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.
Might I also recommend: Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017 ▶ this video
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
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.