Efficient code generation for automatic parallelization and optimization

Proceedings - 2nd International Symposium on Parallel and Distributed Computing, ISPDC 2003

Volumn , Issue , 2015, Pages 23-30

  Bastoul, Cédric ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); DISTRIBUTED COMPUTER SYSTEMS; NETWORK COMPONENTS; OPTIMIZATION;

AUTOMATIC PARALLELIZATION; CODE GENERATION ALGORITHM; EXPERIMENTAL EVIDENCE; GRAPHICAL DESIGNS; POLYHEDRAL MODELING; PROGRAM TRANSFORMATIONS; REAL-LIFE PROBLEMS; TRANSFORMATION FUNCTIONS;

AUTOMATIC PROGRAMMING;

EID: 84947997685     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2003.1267639     Document Type: Conference Paper

References (19)

1. C. Ancourt and F. 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 (long version). Technical Report 2003/43, PRiSM, Versailles University, october 2003.
3. C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam. Putting polyhedral transformations to work. Technical Report 4902, INRIA, july 2003.
4. C. Bastoul and P. Feautrier. Improving data locality by chunking. In CC'12 Int. Conf. on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, april 2003.
5. P. Boulet, A. Darte, G.-A. Silber, and F. Vivien. Loop parallelization algorithms: From parallelism extraction to code generation. volume 24, pages 421-444, 1998.
6. P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In International 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. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22(3):243-268, 1988.
10. M. Griebl, C. Lengauer, and S. Wetzel. Code generation in the polytope model. In PACT'98 International Conference on Parallel Architectures and Compilation Techniques, pages 106-111, 1998.
11. 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.
12. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons, Inc., 1978.
13. M. Le Fur. Parcours de polyèdres paramétrés avec l'élimination de Fourier-Motzkin. Technical Report 2358, INRIA, 1994.
14. 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.
15. 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.
16. J. Ramanujam. Beyond unimodular transformations. The Journal of Supercomputing, 9(4):365-389, 1995.
17. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., 1986.
18. D. Wilde. A library for doing polyhedral operations. Technical report, IRISA, 1993.
19. J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Computing, 20(5):711-728, 1994.