Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192) (1998)
Oct. 12, 1998 to Oct. 18, 1998
Pierre Boulet , LIFL, USTL
Paul Feautrier , Universit? de Versailles-St Quentin en Yvelines
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of related works, we detail our method to scan affine images of polyhedra. After some experimental results we show how our method applies to unions of affine images of polyhedra.We have taken the option to generate low level code without loops. This has allowed us to have a completely general and fully parameterized method without losing efficiency.
Automatic parallelization, code generation, integer programming, PIP, polyheron scanning, linearly bounded lattices
P. Boulet and P. Feautrier, "Scanning Polyhedra without Do-loops," Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192)(PACT), Paris, France, 1998, pp. 4.