Who's Afraid of a Big Bad Lock?
Speaker: Nir Shavit , Sun Labs at Oracle
Date: October 29 2010
Time: 1:00PM to 2:30PM
Location: 32-G575
Host: Nancy Lynch, MIT
Contact: Alex Cornejo, 617 253 19-22, acornejo@csail.mit.edu
Relevant URL: http://groups.csail.mit.edu/tds/tds-seminars.html
Title: Who's Afraid of a Big Bad Lock?
Abstract:
Traditional data structure designs, whether lock-based or lock-free,
provide parallelism via fine grained synchronization among threads.
We introduce a new synchronization paradigm based on coarse locking,
which we call flat combining. The cost of synchronization in flat
combining is so low, that having a single thread holding a lock
perform the combined access requests of all others, delivers, up to
a certain non-negligible concurrency level, better performance than
the most effective parallel finely synchronized implementations. We
use flat-combining to devise, among other structures, new
linearizable stack, queue, and priority queue algorithms that
greatly outperform all prior algorithms.
Joint work with Danny Hendler, Itai Incze, and Moran Tzafrir.
See other events that are part of Theory of Distributed Systems 2010/2011
See other events happening in October 2010
