|
|
 |
|
|
| A Fast Wait-Free Hash Table |
 |
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:
http://www.stanford.edu/class/ee380/
Stanford Computer Systems Laboratory:
http://csl.stanford.edu/
Stanford Center for Professional Development:
http://scpd.stanford.edu/
Stanford University Channel on YouTube:
http://www.youtube.com/stanforduniversity/
Tags : Computer science software engineering programming design application Cliff Click hash table fast concurrent performance |
|
Affichage : 1023
Durée : 4647 s |
|
|
|
|
|
|
|
|
|
|
 |
| |
|
