Session I
9:00am Welcome and Lightning Intros
(Note, we start 30min later than other workshops.)
9:10am Unsynchronized Techniques for Approximate Parallel Computing
Martin Rinard
9:35am Programming with Relaxed Synchronization
Lakshminarayanan Renganarayanan, Vijayalakshmi Srinivasan, Ravi Nair and Daniel Prener
9:50am (Relative) Safety Properties for Relaxed Approximate Programs
Michael Carbin and Martin Rinard
10:05am Break
Session II
10:35am Nondeterminism is unavoidable, but data races are pure evil
Hans-J. Boehm
11:00am Morning Discussion
11:45am Lunch Break
Session III
1:15pm How FIFO is Your Concurrent FIFO Queue?
Andreas Haas, Christoph Kirsch, Hannes Payer and Michael Lippautz
1:35pm The case for relativistic programming
Philip W. Howard and Jonathan Walpole
1:55pm Edge Chasing Delayed Consistency: Pushing the Limits of Weak Memory Models
Trey Cain and Mikko Lipasti
2:15pm Does Better Throughput Require Worse Latency?
David Ungar, Doug Kimelman, Sam Adams and Mark Wegman
2:30pm Parallel Sorting on a Spatial Computer
Max Orhai and Andrew Black
2:50pm Break
Session IV
3:25pm Dancing with Uncertainty
Sasa Misailovic, Stelios Sidiroglou and Martin Rinard
3:45pm Beyond Expert-Only Parallel Programming
Paul McKenney
4:00pm Afternoon Discussion
4:45pm Wrap up