A unifying framework for iteration reordering transformations
- 19 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 153-162 vol.1
- https://doi.org/10.1109/icapp.1995.472180
Abstract
We present a framework for unifying iteration reordering transformations such as loop interchange, loop distribution, skewing, tiling, index set splitting and statement reordering. The framework is based on the idea that a transformation can be represented as a mapping from the original iteration space to a new iteration space. The framework is designed to provide a uniform way to represent and reason about transformations. We also provide algorithms to test the legality of mappings, and to generate optimized code for mappings.Keywords
This publication has 11 references indexed in Scilit:
- Non-unimodular transformations of nested loopsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Compiler blockability of numerical algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Massive parallelism through program restructuringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- SELECTING AFFINE MAPPINGS BASED ON PERFORMANCE ESTIMATIONParallel Processing Letters, 1994
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- A general framework for iteration-reordering loop transformationsPublished by Association for Computing Machinery (ACM) ,1992
- The Omega test: a fast and practical integer programming algorithm for dependence analysisPublished by Association for Computing Machinery (ACM) ,1991
- A data locality optimizing algorithmPublished by Association for Computing Machinery (ACM) ,1991
- Uniform techniques for loop optimizationPublished by Association for Computing Machinery (ACM) ,1991
- More iteration space tilingPublished by Association for Computing Machinery (ACM) ,1989