February 21, 2007 lecture by Cliff Click for the Stanford University Computer Systems Colloquium (EE 380). Cliff presents a wait-free (lock-free) concurrent Hash Table implementation with better single-thread performance than most Hash Tables, and better multi-thread performance than all other implementations he's tried; and, time permitting, he provides a short case study of a java application d
![A Fast Wait-Free Hash Table](https://cdn-ak-scissors.b.st-hatena.com/image/square/f69986e1cfa0fa7c1126fa71476720a5209087f0/height=288;version=1;width=512/https%3A%2F%2Fi.ytimg.com%2Fvi%2FWYXgtXWejRM%2Fhqdefault.jpg)