Scanning polyhedra without Do-loops

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 1998, Pages 4-11

  Boulet, Pierre ^a   Feautrier, Paul ^b  

^a ECOLE CENTRALE DE LILLE   (France)

^b UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

AUTOMATIC PARALLELIZATION; LOOP NESTS; PARAMETERIZED; RELATED WORKS;

PARALLEL ARCHITECTURES;

EID: 84874623028     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.1998.727127     Document Type: Conference Paper

References (13)

1. C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In Proc. of the 3rd ACMSIGPLAN Symposiumon Principles and Practice of Parallel Programming, pages 39-50, Apr. 1991.
2. P. Boulet and P. Feautrier. Scanning polyhedra without do-loops. Technical report, Laboratoire PRiSM, Université de Versailles-StQuentin en Yvelines, France, 1998. available at http://www.lifl.fr/ ~boulet/publi/polyscanRR.ps.gz.
3. Z. Chamski. Scanning polyhedra with do loop sequences. In Workshop on Parallel Algorithms '92, Sofia, 1992.
4. J.-F. Collard. Code generation in automatic parallelizers. In C. Girault, editor, Proc. Int. Conf. on Application in Parallel and Distributed Computing. IFIP WG 10.3, pages 185-194.North Holland, Apr. 1994.
5. J.-F. Collard, P. Feautrier, and T. Risset. Construction of DO loops from systems of affine constraints. Parallel Processing Letters, 5(3):421-436, Sept. 1995.
6. A. Darte. Techniques de parallélisation automatique de nids de boucles. PhD thesis, Ecole Normale Supérieure de Lyon, 1993.
7. P. Feautrier. Parametric integer programming. RAIRO Recherche Opèrationnelle, 22:243-268, Sept. 1988.
8. P. Feautrier. Semantical analysis and mathematical programming. In M. C. et al., editor, Parallel and distributed algorithms, pages 309-320, North Holland, 1989. Elsevier Science Publishers B.V.
9. F. Irigoin. Partitionnement des boucles imbriquées, une technique d'optimisation pour les programmes scientifiques. PhD thesis, Ecole Nationale Supérieure des Mines de Paris, June 1987.
10. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In The 5th Symposium on Frontiers ofMassively Parallel Computation, pages 332-341, McLean, Virginia, Feb. 1995.
11. G.-R. Perrin and C. Reffay. Communication code generation in systems of affine recurrence equations. Integration: the VLSI Journal, 20:63-83, 1995.
12. J. Xue. Automatic non-unimodular transformations of loop nests. Parallel Computing, 20(5):711-728, May 1994.
13. J. Xue. Unimodular transformations of non-perfectly nested loops. Parallel Computing, 22:1621-1645, Feb. 1997.