Integer Affine Transformations of Parametric Z-polytopes and Applications to Loop Nest Optimization
The polyhedral model is a well-known compiler optimization framework for the analysis and transformation of affine loop nests. We present a new method to solve a difficult geometric operation that is raised by this model: the integer affine transformation of parametric Z-polytopes. The result of such a transformation is given by a worst-case exponential union of Z-polytopes. We also propose a polynomial algorithm (for fixed dimension), to count points in arbitrary unions of a fixed number of parametric Z-polytopes. We implemented these algorithms and compared them to other existing algorithms, for a set of applications to loop nest analysis and optimization.
polyhedral model algorithms performance counting solutions to presburger formulas ehrhart polynomials memory hierarchy optimization parametric z-polytopes transformation and enumeration