ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality

Acharya, Aravind and Bondhugula, Uday (2015) PLUTO plus : Near-Complete Modeling of Affine Transformations for Parallelism and Locality. In: ACM SIGPLAN NOTICES, 50 (8). pp. 54-64.

[img] PDF
Acm_Sig_Not_50-8_54_2015.pdf - Published Version
Restricted to Registered users only

Download (306kB) | Request a copy

Abstract

Affine transformations have proven to be very powerful for loop restructuring due to their ability to model a very wide range of transformations. A single multi-dimensional affine function can represent a long and complex sequence of simpler transformations. Existing affine transformation frameworks like the Pluto algorithm, that include a cost function for modern multicore architectures where coarse-grained parallelism and locality are crucial, consider only a sub-space of transformations to avoid a combinatorial explosion in finding the transformations. The ensuing practical tradeoffs lead to the exclusion of certain useful transformations, in particular, transformation compositions involving loop reversals and loop skewing by negative factors. In this paper, we propose an approach to address this limitation by modeling a much larger space of affine transformations in conjunction with the Pluto algorithm's cost function. We perform an experimental evaluation of both, the effect on compilation time, and performance of generated codes. The evaluation shows that our new framework, Pluto+, provides no degradation in performance in any of the Polybench benchmarks. For Lattice Boltzmann Method (LBM) codes with periodic boundary conditions, it provides a mean speedup of 1.33x over Pluto. We also show that Pluto+ does not increase compile times significantly. Experimental results on Polybench show that Pluto+ increases overall polyhedral source-to-source optimization time only by 15%. In cases where it improves execution time significantly, it increased polyhedral optimization time only by 2.04x.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the ASSOC COMPUTING MACHINERY, 2 PENN PLAZA, STE 701, NEW YORK, NY 10121-0701 USA
Keywords: Affine transformations; polyhedral model; automatic parallelization; tiling; affine scheduling; stencil computations
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 20 Jan 2016 05:26
Last Modified: 20 Jan 2016 05:26
URI: http://eprints.iisc.ac.in/id/eprint/53154

Actions (login required)

View Item View Item