On Code-Generation in the Polyhedral Model
Fabien Quillere and Sanjay Rajopadhye, IRISA, Rennes, France
- Full Paper(.ps version)
Automatic parallelization in the polyhedral model is based on affine
transformations from an original computation domain (iteration space) to a target
space-time domain, often with a different transformation for each
variable. Code generation, an often ignored step in this process that has a
significant impact on the quality of the final code. Previous methods of doing code generation are based on loop splitting, however they have non-optimal behavior when working in parameterized programs.
We have previously developed a general parameterized method for code generation based on dual representation of polyhedra. Here, we present a formal proof of correctness of the proposed method. We also discuss how our algorithm enables fine control over the tradeoff between code size and control overhead.
Please contact our
webadmin with any comments or changes.
Unless explicitly stated otherwise, all material is
copyright © The University of Edinburgh.