THE VIDEO SHELF · lock-free data structures
Advanced Topics in Programming Languages: A Lock-Free Hash Table
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.
Why HN readers recommended it
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.
This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.
Video & recommendation details
- Creator / channel
- GoogleTalksArchive
- Topic
- lock-free data structures
- Format
- talk
- Level
- advanced
- HN recommenders in dataset
- 4
- HN mentions in dataset
- 5
- Recommendation years in dataset
- 2013–2024
These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.
From the original HN conversations
Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.
Probably this one: [VIDEO] Anything from Cliff Click is quite good. This guy has a very deep understanding of compilers, virtual-machines, CPUs, and their interactions. A JVM does that? [LINK] Java on a 1000 Cores [LINK]
qznc on Hacker News · 2013-04
In Ask HN: What's the best technical talk you've heard?For folks interested in this topic I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap: [VIDEO]
benreesman on Hacker News · 2024-09
In Build a serverless ACID database with this one neat trick (atomic PutIfAbsent)Dr. Cliff Click's Google talk on Lock-Free Hashtable is here: [VIDEO] Acc to Dr. Click, if you do not have 30+ CPUs in a single machine, ConcurrentHashMap (built-in to the JDK) will do the trick more often than not. The talk is really worth it, …
ignoramous on Hacker News · 2016-02
In A resizable concurrent map
Summaries, classifications and recommendation records are from the HackerTube source dataset. Read about this library and its limitations.