Advanced Topics in Programming Languages: A Lock-Free Hash Table
4 人推荐 · 跨 5 个月 · 2013–2024
中文导读
在 2007 年的 Google Tech Talk 中，Azul Systems 的 Cliff Click 演示了一款可扩展至 768 核 CPU 的无锁并发哈希表（lock-free concurrent hash table）。他跳出传统的 happens-before 与内存序理论，用一套独到推导论证了其正确性。
为什么 HN 推它
HN 公认的顶级硬核技术演讲之一，把如何基于 Compare-and-Swap 构建超高扩展性无锁哈希表讲得通透而彻底。
「强烈推荐 Cliff Click 这场演讲，教你如何用 CAS 搭出高扩展的并发哈希表。」HN 网友原话：I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap
英文原摘要（HackerTube / Claude 整理）
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.
HN 上的提及
Anything from Cliff Click is quite good.
The talk is really worth it, if you're curious about the design
I've always admired the wizardry of Cliff Click's concurrent hash
I should probably leave an example of it done well
I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap