PickVidsAdvanced Topics in Programming Languages: A Lock-Free Hash Table
推荐理由
I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap
强烈推荐benreesman · 原文
说明
这是2012年由GoogleTalksArchive发布的一部演讲，主题归在Algorithms & data structures。它讲的是lock-free data structures这一支里的具体问题，而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成：A 2007 Google Tech Talk in which Cliff Click of Azul Systems presents a lock-free concurrent hash table that scales to 768 CPUs. He explains why it is correct by reasoning in a different way than usual happens-before and memory-order arguments.这些读者给出的理由，核心是：HN regards it as one of the best technical talks, a deep and clear walkthrough of scalable lock-free hash tables built on compare-and-swap.讲法不绑某一条新闻，过几年仍然可以当材料看。从2013年到2024年，有4位不同的读者在5个不同月份把它推荐出来，其中明确叫别人去看的有2次。适合一次性看完。讲者把一个判断讲透，演示是在给这个判断配例子。如果已经会了基本定义，就把注意力放在它怎么把lock-free data structures变成能跟着复述的例子。
视频信息
- 频道
- GoogleTalksArchive
- 时长
- 58 分 36 秒
- 发布年份
- 2012
同主题更多
- 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