Skip to Main content Skip to Navigation
Journal articles

Parametric Analysis of Polyhedral Iteration Spaces

Abstract : In the area of automatic parallelization of programs, analyzing and transforming loop nests with parametric affine loop bounds requires fundamental mathematical results. The most common geometrical model of iteration spaces, called the polytope model, is based on mathematics dealing with convex and discrete geometry, linear programming, combinatorics and geometry of numbers. In this paper, we present automatic methods for computing the parametric vertices and the Ehrhart polynomial, i.e., a parametric expression of the number of integer points, of a polytope defined by a set of parametric linear constraints. These methods have many applications in analysis and transformations of nested loop programs. The paper is illustrated with exact symbolic array dataflow analysis, estimation of execution time, and with the computation of the maximum available parallelism of given loop nests.
Complete list of metadata

https://hal.inria.fr/inria-00534840
Contributor : Vincent Loechner Connect in order to contact the contributor
Submitted on : Wednesday, November 10, 2010 - 3:56:10 PM
Last modification on : Wednesday, November 18, 2020 - 5:18:06 PM

Links full text

Identifiers

Collections

Citation

Philippe Clauss, Vincent Loechner. Parametric Analysis of Polyhedral Iteration Spaces. Journal of Signal Processing Systems, Springer, 1998, 19 (2), pp.179-194. ⟨10.1023/A:1008069920230⟩. ⟨inria-00534840⟩

Share

Metrics

Record views

445