PickVidsCppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
推荐理由
Excellent talk which explains the concepts really clearly and concisely.
说明
这是2017年由CppCon发布的一部演讲，主题归在Algorithms & data structures。它讲的是hash table design这一支里的具体问题，而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成：Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data structure.这些读者给出的理由，核心是：HN repeatedly cites it as the definitive explanation of SwissTable, the design behind Abseil, Rust's hash map and Go's maps.讲法不绑某一条新闻，过几年仍然可以当材料看。从2018年到2026年，有9位不同的读者在10个不同月份把它推荐出来，其中明确叫别人去看的有4次。适合一次性看完。讲者把一个判断讲透，演示是在给这个判断配例子。如果已经会了基本定义，就把注意力放在它怎么把hash table design变成能跟着复述的例子。
视频信息
- 频道
- CppCon
- 时长
- 59 分 34 秒
- 发布年份
- 2017
同主题更多
- 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
- The Fastest Way to Board a Plane Feels Like the Slowest