• 2998 views

    Lec 16 - A Fast Wait-Free Hash Table

    "Lec 16 - 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/

    Video is embedded from external source so embedding is not available.

    Video is embedded from external source so download is not available.

    Here is the next lecture for this course

    Watch NEXT
    LECTURE
    2708 views     Lec 159 - 2011 Calculus AB Free Response #1a

    Lec 17 - An Ultrafast Optical Digital Technology Smart Light

     01:05:02
    Lecture List | Course Details | Contents | Related

    No content is added to this lecture.

    Go to course:

    This video is a part of a lecture series from of stanford