Wed 17 Jun 2015 15:15 - 15:40 at PLDI Main BLUE (Portland 254-255) - Parallelism Chair(s): Sara Baghsorkhi

We describe a system that uses automated planning to synthesize correct and efficient parallel graph programs from high-level algorithmic specifications. We have used this system to synthesize parallel programs for four graph problems: triangle counting, maximal independent set computation, preflow-push maxflow, and connected components. Experiments on realistic graph inputs show that the synthesized implementations exhibit speedups of up to 45x and often outperform hand-written, highly-tuned implementations.

Wed 17 Jun
Times are displayed in time zone: Tijuana, Baja California change

14:00 - 15:40
14:00
25m
Talk
Celebrating Diversity: A Mixture of Experts Approach for Runtime Mapping in Dynamic Environments
Research Papers
Murali Krishna EmaniThe University of Edinburgh, Michael F. P. O'BoyleUniversity of Edinburgh
Media Attached
14:25
25m
Talk
Efficient Execution of Recursive Programs on Commodity Vector Hardware
Research Papers
Bin RenPacific Northwest National Laboratories, Youngjoon JoPurdue University, Sriram KrishnamoorthyPacific Northwest National Laboratories, Kunal AgrawalWashington University in St. Louis, Milind KulkarniPurdue University
Media Attached
14:50
25m
Talk
Loop and Data Transformations for Sparse Matrix Code
Research Papers
Anand VenkatUniversity of Utah, Mary HallUniversity of Utah, Michelle StroutColorado State University
Media Attached
15:15
25m
Talk
Synthesizing Parallel Graph Programs via Automated Planning
Research Papers
Dimitrios PrountzosThe University of Texas at Austin, Texas, USA, Roman ManevichBen-Gurion University of the Negev, Keshav PingaliUniversity of Texas, Austin
Media Attached