Code generation in the polyhedral model is easier than you think

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2004, Pages 7-16

  Bastoul, Cédric ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROGRAM COMPILERS; SET THEORY; TREES (MATHEMATICS); VECTORS;

CODE GENERATION; LOOP INVERSION; POLYHEDRAL MODEL; POLYHEDRAL SCANNING PROBLEM;

PARALLEL PROCESSING SYSTEMS;

EID: 10444289646     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. C. Ancourt and R Irigoin. Scanning polyhedra with DO loops. In 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 39-50, June 1991.
2. C. Bastoul. Efficient code generation for automatic parallelization and optimization. In ISPDC'03 IEEE International Symposium on Parallel and Distributed Computing, pages 23-30, Ljubljana, october 2003.
3. C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam. Putting polyhedral transformations to work. In LCPC'16 International Workshop on Languages and Compilers for Parallel Computers, LNCS 2958, pages 209-225, College Station, october 2003.
4. Y. Bouchebaba. Optimisation des transferts de données pour le traitement du signal: pavage, fusion et réallocation des tableaux. PhD thesis, École des mines de Paris, 2002.
5. P. Boulet, A. Darte, G.-A. Silber, and F. Vivien. Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing, 24(3):421-444, 1998.
6. P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs. In Int. Conference on Supercomputing, pages 278-285, Philadelphia, may 1996.
7. J.-F. Collard, T. Risset, and P. Feautrier. Construction of DO loops from systems of affine constraints. Parallel Processing Letters, 5(3):421-436, 1995.
8. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Fifth ACM Symposium on Principles of Programming Languages, pages 84-97, Tucson, Jan. 1978.
9. A. Darte and Y. Robert. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing, 20(5):679-710, 1994.
10. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22(3):243-268, 1988.
11. P. Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, february 1991.
12. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II: multidimensional time. Int. Journal of Parallel Programming, 21(6):389-420, december 1992.
13. M. Griebl, P. Feautrier, and C. Lengauer. Index set splitting. Int. Journal of Parallel Programming, 28(6):607-631, 2000.
14. M. Griebl, C. Lengauer, and S. Wetzel. Code generation in the polytope model. In PACT'98 Int. Conf. on Parallel Architectures and Compilation Techniques, pages 106-111, 1998.
15. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers'95 Symposium on the frontiers of massively parallel computation, McLean, 1995.
16. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons, Inc., 1978.
17. M. Le Fur. Parcours de polyèdres paramétrés avec l'élimination de Fourier-Motzkin. Technical Report 2358, INRIA, 1994.
18. H. Le Verge. A note on Chernikova's algorithm. Technical Report 635, IRISA, 1992.
19. H. Le Verge, V. Van Dongen, and D. Wilde. Loop nest synthesis using the polyhedral library. Technical Report 830, IRISA, 1994.
20. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. International Journal of Parallel Programming, 22(2):183-205, April 1994.
21. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5):469-498, october 2000.
22. J. Ramanujam. Beyond unimodular transformations. The Journal of Supercomputing, 9(4):365-389, 1995.
23. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., 1986.
24. Y. Slama and M. Jemni. Vers l'extension du modèle polyédrique aux transformations irrégulières. In CARI'5 International Conference on African Research in Computer Science, Antananarivo, october 2000.
25. S. Wetzel. Automatic code generation in the polytope model. Master's thesis, Facultät für Mathematik und Informatik, Universität Passau, 1995.
26. D. Wilde. A library for doing polyhedral operations. Technical report, IRISA, 1993.
27. J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Computing, 20(5):711-728, 1994.
28. J. Xue. Transformations of nested loops with non-convex iteration spaces. Parallel Computing, 22(3):339-368, 1996.