Polyhedral AST generation is more than scanning polyhedra [TOPLAS]
Abstract mathematical representations such as integer polyhedra have been shown to be useful to precisely analyze computational kernels and to express complex loop transformations. Such transformations rely on abstract syntax tree (AST) generators to convert the mathematical representation back to an imperative program. Such generic AST generators avoid the need to resort to transformation-specific code generators, which may be very costly or technically difficult to develop as transformations become more complex. Existing AST generators have proven their effectiveness, but they hit limitations in more complex scenarios. Specifically, (1) they do not support or may fail to generate control flow for complex transformations using piecewise schedules or mappings involving modulo arithmetic; (2) they offer limited support for the specialization of the generated code exposing compact, straightline, vectorizable kernels with high arithmetic intensity necessary to exploit the peak performance of modern hardware; (3) they offer no support for memory layout transformations; and (4) they provide insufficient control over the AST generation strategy, preventing their application to complex domain-specific optimizations.
We present a new AST generation approach that extends classical polyhedral scanning to the full generality of Presburger arithmetic, including existentially quantified variables and piecewise schedules, and introduce new optimizations for the detection of components and shifted strides. Not limiting ourselves to control flow generation, we expose functionality to generate AST expressions from arbitrary piecewise quasi-affine expressions, which enables the use of our AST generator for data-layout transformations. We complement this with support for specialization by polyhedral unrolling, user-directed versioning, and specialization of AST expressions according to the location at which they are generated, and we complete this work with fine-grained user control over the AST generation strategies used. Using this generalized idea of AST generation, we present how to implement complex domain-specific transformations without the need to write specialized code generators, but instead relying on a generic AST generator parametrized to a specific problem domain.
Wed 15 JunDisplayed time zone: Tijuana, Baja California change
15:30 - 17:00
Parsing & CompilationResearch Papers at Grand Ballroom San Rafael
Chair(s): Michelle Strout The University of Arizona
|Automatic Storage Optimization for Arrays [TOPLAS]|
Somashekaracharya G Bhaskaracharya Indian Institute of Science and National Instruments, Uday Bondhugula Indian Institute of Science, Albert Cohen INRIAMedia Attached
|Polyhedral AST generation is more than scanning polyhedra [TOPLAS]|
Tobias Grosser ETH Zurich, Switzerland, Sven Verdoolaege , Albert Cohen INRIAMedia Attached
|On the Complexity and Performance of Parsing with Derivatives|
Michael D. Adams University of Utah, Celeste Hollenbeck University of Utah, Matthew Might University of Utah, USAPre-print Media Attached