Advanced Topics in Programming Languages: A Lock-Free Hash Table

Why it was recommended

I highly recommend this talk by Cliff Click about building highly scalable hash tables via Compare And Swap

Strong recommendationbenreesman · Original2024-09

What it covers

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. It is for someone who wants the derivation, proof, or implementation detail.

Video details

Channel

GoogleTalksArchive

Length

58 min 36 sec

Year

2012

More in this topic

• 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