Workshop Recordings

Session I
Welcome and Lightning Intros
Unsynchronized Techniques for Approximate Parallel Computing
Martin Rinard
Programming with Relaxed Synchronization
Lakshminarayanan Renganarayanan, Vijayalakshmi Srinivasan, Ravi Nair and Daniel Prener
(Relative) Safety Properties for Relaxed Approximate Programs
Michael Carbin and Martin Rinard
Session II
Nondeterminism is unavoidable, but data races are pure evil
Hans-J. Boehm
Morning Discussion
First discussion session of the workshop.
Session III
How FIFO is Your Concurrent FIFO Queue?
Andreas Haas, Christoph Kirsch, Hannes Payer and Michael Lippautz
The case for relativistic programming
Philip W. Howard and Jonathan Walpole
Edge Chasing Delayed Consistency: Pushing the Limits of Weak Memory Models
Trey Cain and Mikko Lipasti
Does Better Throughput Require Worse Latency?
David Ungar, Doug Kimelman, Sam Adams and Mark Wegman
Parallel Sorting on a Spatial Computer, Max Orhai and Andrew Black
Session IV
Dancing with Uncertainty
Sasa Misailovic, Stelios Sidiroglou and Martin Rinard
Beyond Expert-Only Parallel Programming
Paul McKenney
Afternoon Discussion
Second and final discussion session of the workshop.