Sparse Computation Data Dependence Simplification for Efficient Compiler-Generated Inspectors
This paper presents a combined compile-time and runtime loop-carried
dependence analysis of sparse matrix codes and evaluates its
performance in the context of wavefront parallellism.
Sparse computations incorporate indirect memory accesses such as x[col[j]]
whose memory locations cannot be determined until runtime.
The key contributions of this paper are two compile-time techniques for
significantly reducing the overhead of runtime dependence testing:
(1) identifying new equality constraints that result in more efficient runtime inspectors, and
(2) identifying subset relations between dependence constraints such
that one dependence test subsumes another one that is therefore eliminated.
New equality constraints discovery is
enabled by taking advantage of domain-specific knowledge about index arrays, such as col[j].
These simplifications lead to automatically-generated
inspectors that make it practical to parallelize such computations.
We analyze our simplification methods for a collection of seven sparse computations.
The evaluation shows our methods reduce the complexity of the runtime
Experimental results for a collection of five large matrices
show parallel speedups ranging from 2x to more than 8x running on a 8-core CPU.
Tue 25 JunDisplayed time zone: Tijuana, Baja California change
10:00 - 11:00
|Sparse Computation Data Dependence Simplification for Efficient Compiler-Generated Inspectors|
PLDI Research Papers
Mahdi Soltan Mohammadi University of Arizona, Eddie C. Davis Boise State University, USA, Mary Hall University of Utah, Maryam Mehri Dehnavi University of Toronto, Payal Nandy University of Utah, USA, Catherine R. M. Olschanowsky Boise State University, USA, Anand Venkat University of Utah, Tomofumi Yuki , Kazem Cheshmi University of Toronto, Michelle Strout University of ArizonaLink to publication DOI Pre-print Media Attached
|Modular Divide-and-Conquer Parallelization of Nested Loops|
PLDI Research PapersMedia Attached
|Generating Piecewise-Regular Code from Irregular Structures|
PLDI Research Papers
Travis Augustine Colorado State University, USA, Janarthanan Sarma Colorado State University, USA, Louis-Noël Pouchet Colorado State University, Gabriel Rodríguez Universidade da Coruña, SpainLink to publication DOI