A Polyhedral Approach to Ease the Composition of Program
Transformations
A. Cohen, S. Girbal, and O. Temam. Euro-Par 2004 Parallel Processing, Springer Berlin Heidelberg, (2004)
Abstract
We wish to extend the effectiveness of loop-restructuring
compilers by improving the robustness of loop transformations
and easing their composition in long sequences. We propose a
formal and practical framework for program transformation. Our
framework is well suited for iterative optimization techniques
searching not only for the appropriate parameters of a given
transformation, but for the program transformations themselves,
and especially for compositions of program transformations. This
framework is based on a unified polyhedral representation of
loops and statements, enabling the application of generalized
control and data transformations without reference to a
syntactic program representation. The key to our framework is to
clearly separate the impact of each program transformation on
three independent components: the iteration domain, the
iteration schedule and the memory access functions. The
composition of generalized transformations builds on
normalization rules specific to each component of the
representation. Our techniques have been implemented on top of
Open64/ORC.
%0 Book Section
%1 Cohen2004-xu
%A Cohen, Albert
%A Girbal, Sylvain
%A Temam, Olivier
%B Euro-Par 2004 Parallel Processing
%D 2004
%I Springer Berlin Heidelberg
%K Polyhedral_model Polyhedral_transformations To_Read
%P 292--303
%T A Polyhedral Approach to Ease the Composition of Program
Transformations
%X We wish to extend the effectiveness of loop-restructuring
compilers by improving the robustness of loop transformations
and easing their composition in long sequences. We propose a
formal and practical framework for program transformation. Our
framework is well suited for iterative optimization techniques
searching not only for the appropriate parameters of a given
transformation, but for the program transformations themselves,
and especially for compositions of program transformations. This
framework is based on a unified polyhedral representation of
loops and statements, enabling the application of generalized
control and data transformations without reference to a
syntactic program representation. The key to our framework is to
clearly separate the impact of each program transformation on
three independent components: the iteration domain, the
iteration schedule and the memory access functions. The
composition of generalized transformations builds on
normalization rules specific to each component of the
representation. Our techniques have been implemented on top of
Open64/ORC.
@incollection{Cohen2004-xu,
abstract = {We wish to extend the effectiveness of loop-restructuring
compilers by improving the robustness of loop transformations
and easing their composition in long sequences. We propose a
formal and practical framework for program transformation. Our
framework is well suited for iterative optimization techniques
searching not only for the appropriate parameters of a given
transformation, but for the program transformations themselves,
and especially for compositions of program transformations. This
framework is based on a unified polyhedral representation of
loops and statements, enabling the application of generalized
control and data transformations without reference to a
syntactic program representation. The key to our framework is to
clearly separate the impact of each program transformation on
three independent components: the iteration domain, the
iteration schedule and the memory access functions. The
composition of generalized transformations builds on
normalization rules specific to each component of the
representation. Our techniques have been implemented on top of
Open64/ORC.},
added-at = {2015-04-11T18:41:09.000+0200},
author = {Cohen, Albert and Girbal, Sylvain and Temam, Olivier},
biburl = {https://www.bibsonomy.org/bibtex/2f69f36f9950ba573e3a4ba433f95785b/christophv},
booktitle = {{Euro-Par} 2004 Parallel Processing},
interhash = {f4b67ee18aff38ca227d9daf99c36c81},
intrahash = {f69f36f9950ba573e3a4ba433f95785b},
keywords = {Polyhedral_model Polyhedral_transformations To_Read},
pages = {292--303},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2015-04-11T18:41:09.000+0200},
title = {A Polyhedral Approach to Ease the Composition of Program
Transformations},
year = 2004
}