PickVidsBryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
推荐理由
Bryan Cantrill does a pretty good survey of caching strategies in the intro
说明
这是2017年由PapersWeLove发布的一部演讲，主题归在Algorithms & data structures。它讲的是cache replacement algorithms这一支里的具体问题，而不是把整个领域扫一遍。适合已经能看懂基本术语、想继续往下走的人。内容上可以概括成：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.讲法不绑某一条新闻，过几年仍然可以当材料看。从2019年到2024年，有3位不同的读者在3个不同月份把它推荐出来，其中明确叫别人去看的有0次。适合一次性看完。讲者把一个判断讲透，演示是在给这个判断配例子。如果已经会了基本定义，就把注意力放在它怎么把cache replacement algorithms变成能跟着复述的例子。
视频信息
- 频道
- PapersWeLove
- 时长
- 1 小时 47 分
- 发布年份
- 2017
同主题更多
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019