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

pldi2015-papers
14:00 - 15:40: Research Papers - Parallelism at PLDI Main BLUE (Portland 254-255)
Chair(s): Sara BaghsorkhiIntel Labs
pldi2015-papers14:00 - 14:25
Talk
Murali Krishna EmaniThe University of Edinburgh, Michael O'BoyleUniversity of Edinburgh
Media Attached
pldi2015-papers14:25 - 14:50
Talk
Bin RenPacific Northwest National Laboratories, Youngjoon JoPurdue University, Sriram KrishnamoorthyPacific Northwest National Laboratories, Kunal AgrawalWashington University in St. Louis, Milind KulkarniPurdue University
Media Attached
pldi2015-papers14:50 - 15:15
Talk
Anand VenkatUniversity of Utah, Mary HallUniversity of Utah, Michelle StroutColorado State University
Media Attached
pldi2015-papers15:15 - 15:40
Talk
Dimitrios PrountzosThe University of Texas at Austin, Texas, USA, Roman ManevichBen-Gurion University of the Negev, Keshav PingaliUniversity of Texas, Austin
Media Attached