By Topic

Non-unimodular transformations of nested loops

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
J. Ramanujam ; Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA

A linear algebraic approach to modeling loop transformations is presented which unifies apparently unrelated recent developments in supercompiler technology. The relationship between the dependence abstraction called dependence cones and fully permutable loop nests is shown. Compound transformations are modeled as matrices. Nonsingular linear transformations that subsume the class of unimodular transformations are presented. Nonunimodular transformations (with determinant⩾1) create `holes' in the transformed iteration space. The step size of loops is changed in order to `step aside from these holes' when traversing the transformed iteration space. For the class of nonunimodular loop transformations, algorithms for deriving the loop bounds, the array access expressions, and step sizes of loops in the nest are given. The algorithms are based on the Hermite normal form of the transformation matrix. The use of this approach in several problems such as generation of tile sets, distributed memory code generation, and dependence analysis

Published in:

Supercomputing '92., Proceedings

Date of Conference:

16-20 Nov 1992