* Distributed Computing Half-Day Conference - Thursday, July 19th, 2012

please register in advance HERE 
 
Schedule
 
9:00 - 9:25     Gathering
 
9:25 - 9:30     Welcome
 
9:30 - 9:50     Hagit Attiya, Polylogarithmic implementations for bounded-use objects
 
9:50 - 10:10    Eli Gafni, UCLA, Distributed Shared-Memory Register-Allocation in Linear Space
 
10:10- 10:30    Sergio Rajsbaum, Distributed Checkers
 
10:30- 11:00   Danny Hendler,  Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
 
11:00- 11:30   Coffee Break
 
11:30- 11:50    Alexander Matveev, Pessimistic Software Lock-Elision
 
11:50- 12:10    Alex Kogan, Creating Fast Wait-Free Algorithms
 
12:10- 12:30    Adam Morrison, CBTree: A Practical Concurrent Self-Adjusting Search Tree
 
12:30- 12:50   Dmitri Perelman,  SALSA: Scalable and Low Synchronization NUMA-aware Algorithm for Producer-Consumer Pools
 
12:50- 13:40    Lunch
 
13:40- 14:00    Armando Castan~eda, Reaching agreement vs breaking symmetry
 
14:00- 14:20    Yehuda Afek, Asynchrony From Synchrony