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

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly-wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations; in the absence of data parallelism, it seems that such algorithms are not well-suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data-parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units as well as accelerators using Intel’s AVX512 units.

PLDI 2015 Artifact Evaluated Badge

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

14:00 - 15:40: ParallelismResearch Papers at PLDI Main BLUE (Portland 254-255)
Chair(s): Sara BaghsorkhiIntel Labs
14:00 - 14:25
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 - 14:50
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 - 15:15
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 - 15:40
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