Schedule for Sunday, 17 March
8:50 am–9:00 am: Welcome
9:00 am–10:00 am: Invited Talk
- The Imperative of Disciplined Parallelism: A Hardware Architect’s Perspective. Sarita Adve (University of Illinois at Urbana-Champaign)
10:00 am–10:30 am: Coffee Break
10:30 am–11:20 am: Session 1: Type Systems and Verification
Session Chair: Edwin Westbrook
- Balloon Types for Safe Parallelisation over Arbitrary Object Graphs. Marco Servetto, David J. Pearce, Lindsay Groves, and Alex Potanin (Victoria University of Wellington)
- High-Level Abstractions for Safe Parallelism. Robert L. Bocchino Jr. (Carnegie Mellon University), Hannes Mehnert (IT University of Copenhagen), and Jonathan Aldrich (Carnegie Mellon University)
11:20am–12:10pm: Session 2: Task Parallelism
Session Chair: Robert Bocchino
- Finish Accumulators: A Deterministic Reduction Construct for Dynamic Task Parallelism. Jun Shirako, Vincent Cave, Jisheng Zhao, and Vivek Sarkar (Rice University)
- TARDIS: Task-level Access Race Detection by Intersecting Sets. Weixing Ji (Beijing Institute of Technology) and Li Lu and Michael L. Scott (University of Rochester)
12:10pm-1:30pm: Lunch
1:30pm-2:30pm: Invited Talk
- Internally Deterministic Parallel Algorithms. Guy Blelloch (Carnegie Mellon University)
2:35pm-3:00pm: Session 3: Execution-Level Determinism
Session Chair: Luis Ceze
- Deterministic Scaling. Gabriel Southern, Madan Das, and Jose Renau (UC Santa Cruz)
3:00pm-3:30pm: Coffee Break
3:30pm-4:20pm: Session 3 (continued)
- Increasing Concurrency in Deterministic Runtimes with Conversion. Timothy Merrifield and Jakob Eriksson (University of Illinois at Chicago)
- Reducing Logging Overhead for Deterministic Execution. Madan Das, Gabriel Southern, and Jose Renau (UC Santa Cruz)
4:20pm-5:10pm: Session 4: Controlling Nondeterminism
Session Chair: Joseph Devietti
- Determinism and Reproducibility in Large-Scale HPC Systems. Wei-Fan Chiang, Ganesh Gopalakrishnan, and Zvonimir Rakamaric (University of Utah) and Dong H. Ahn and Gregory L. Lee (Lawrence Livermore National Laboratory)
- Input-Covering Schedules for Multithreaded Programs. Tom Bergan, Luis Ceze, and Dan Grossman (University of Washington)