Advanced Topics in Programming Languages: A Lock-Free Hash Table
GoogleTalksArchive · 4 则 HN 推荐
视频问答
可以让 AI 解释当前片段，或总结整部视频。如果回答附有时间戳，点击即可跳到对应片段。
试着问：这里讲的是什么意思？
需要用 Google 登录。确认前可查看最多会扣除多少积分。
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 推荐的原因： 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.
“I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap” 阅读 HN 讨论 ↗