Hashing and the New Multicore Algorithmics
Speaker: Nir Shavit , Tel-Aviv University and Sun Labs
Date: March 9 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Host: Silvio Micali, CSAIL, MIT
Contact: Be, 3-6098, imbe@mit.edu
Relevant URL: As multicore machines become our mainstream computing platform,
their unique architectural properties (supporting synchronization
and coherence) and the new classes of algorithms they are intended
to run, are forcing us to rethink our basic algorithms. The result
is a flurry of activity in the design of concurrent algorithms and
techniques to improve concurrent programming.
This talk will provide a glimpse into the work in this area. I will
use concurrent hashing as an example of this new research wave,
presenting two new high performance multicore hash-table algorithms:
split-ordered hashing and hopscotch hashing. These algorithms are
examples of how the new hardware has necessitated alternative
algorithmic approaches, and how in turn these new algorithmics carry
into the sequential world.
See other events that are part of Theory Colloquium 2009/2010
See other events happening in March 2010
