Wednesday, October 10, 2012

A Fast Wait-Free Hash Table

A Fast Wait-Free Hash Table Tube. Duration : 77.45 Mins.


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 doing device drier model checking. EE 380 | Computer Systems Colloquium: www.stanford.edu Stanford Computer Systems Laboratory: csl.stanford.edu Stanford Center for Professional Development: scpd.stanford.edu Stanford University Channel on YouTube: www.youtube.com

0 comments:

Post a Comment