Recherche - SPPoC: manipulation automatique de polyèdres pour la compilation

The polyhedral model is quite popular in the field of parallelizing compilers. So, research prototypes tend to use tools like PIP (parametric integer programming solver), the PolyLib (library for polyhedra manipulation) or Omega (library and calculator for Presburger formulas). The two main drawbacks of these tools are a poor human-computer interface and a lack of aggressive simplification. This last deficiency leads to sequences of computations which give too complex results or even that cannot be completed due to memory exhaustion or time constraints. The SPPoC (Symbolic Parameterized Polyhedral Calculator) library brings a solution to these problems due to its completely symbolic interface and to its advanced simpli- fication modules. It also allows the unification of different tools. We present two applications which use SPPoC : a code generator and a communication volume estimator. MOTS-CLES : Polyedres, Calcul symbolique, Generation de code, Transformations de boucles, Data-parallelisme, Volume de communications, PIP, PolyLib, Omega Library

[1]  Monica S. Lam,et al.  A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..

[2]  William Pugh,et al.  The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[3]  Pierre Boulet,et al.  Communication Pre-evaluation in HPF , 1998, Euro-Par.

[4]  Yves Robert,et al.  Mapping Affine Loop Nests , 1996, Parallel Comput..

[5]  Denyse Baillargeon,et al.  Bibliographie , 1929 .

[6]  Paul Feautrier,et al.  Construction of Do Loops from Systems of Affine Constraints , 1995, Parallel Process. Lett..

[7]  Yves Robert,et al.  Affine-by-Statement Scheduling of Uniform and Affine Loop Nests over Parametric , 1995, J. Parallel Distributed Comput..

[8]  William Pugh,et al.  A practical algorithm for exact array dependence analysis , 1992, CACM.

[9]  W. Kelly,et al.  Code generation for multiple mappings , 1995, Proceedings Frontiers '95. The Fifth Symposium on the Frontiers of Massively Parallel Computation.

[10]  Pierre Boulet,et al.  Scanning polyhedra without Do-loops , 1998, Proceedings. 1998 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.98EX192).

[11]  P. Feautrier.  Parametric integer programming , 1988 .

[12]  Doran Wilde,et al.  A LIBRARY FOR DOING POLYHEDRAL OPERATIONS , 2000 .

[13]  Philippe Clauss.  Counting Solutions to Linear and Nonlinear Constraints Through Ehrhart Polynomials: Applications to Analyze and Transform Scientific Programs , 1996, International Conference on Supercomputing.

[14]  Yves Robert,et al.  Constructive Methods for Scheduling Uniform Loop Nests , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Vincent Loechner,et al.  Deriving Formulae to Count Solutions to Parameterized Linear Systems using Ehrhart Polynomials: Appl , 1997 .

[16]  Vincent Loechner,et al.  Parametric Analysis of Polyhedral Iteration Spaces , 1998, J. VLSI Signal Process..

[17]  Yves Robert,et al.  Mapping affine loop nests: new results , 1995, HPCN Europe.