A Fast Wait-Free Hash Table 
A Fast Wait-Free Hash Table
by Stanford
Video Lecture 16 of 27
1 rating
Views: 2,541
Date Added: August 27, 2009

Lecture Description


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.

Course Index

Course Description


In this course, Stanford University gives 27 video lectures on the Computer Systems Laboratory Colloquium. This course features weekly speakers on current research and developments in computer systems. Topics touch upon all aspects of computer science and engineering including logic design, computer organization and architecture, software engineering, computer applications, public policy, and the social, business, and financial implications of technology. Frequently the Colloquium provides the first public forum for discussion of new products, discoveries, or ideas. This playlist consists of seminar speakers recorded during the 2006-2007 academic year.



The original name of this course is: Computer Systems Laboratory Colloquium (2006-2007).

Comments

There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)