Polyhedral code generation in the real world

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3923 LNCS, Issue , 2006, Pages 185-201

  Vasilache, Nicolas ^a   Bastoul, Cédric ^a   Cohen, Albert ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LOOP NESTS; LOOP TRANSFORMATIONS; POLYHEDRAL MODELS; TARGET CODES;

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING; DATA REDUCTION; MATHEMATICAL MODELS; OPTIMIZATION; SOFTWARE ENGINEERING;

PROGRAM COMPILERS;

EID: 33745804733     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11688839_16     Document Type: Conference Paper

References (29)

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. In ISPDC'03 IEEE Intl. Symp. on Parallel and Distributed Computing, pages 23-30, Ljubljana, October 2003.
3. C. Bastoul. Code generation in the polyhedral model is easier than you think. In PACT'13 IEEE Intl. Conf. on Parallel Architecture and Compilation Techniques, pages 7-16, Juan-les-Pins, September 2004.
4. C. Bastoul and P. Feautrier. Improving data locality by chunking. In CC'12 Intl. 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. Parallel Computing, 24(3):421-444, 1998.
6. A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam, and N. Vasilache. Facilitating the search for compositions of program transformations. In ACM ICS'05 International Conference on Supercomputing, pages 151-160, Cambridge, June 2005.
7. G. Dantzig. Maximization of a linear function of variables subject to linear inequalities. In T. Koopmans, editor, Activity Analysis of Production and Allocation, Cowles Commission Monograph No. 13, pages 339-347, New York, 1951. John Wiley & Sons, Inc.
8. A. Darte and Y. Robert. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing, 20(5)-.679-710, 1994.
9. P. Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, february 1991.
10. 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.
11. B. Franke and M. O'Boyle. A complete compiler approach to auto-parallelizing c programs for Multi-DSP systems. IEEE Transactions on Parallel and Distributed Systems (TPDS), 16(3):234-245, march 2005.
12. M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. Facultät für Mathematik und Informatik, Universität Passau, 2004.
13. I. Hurbain, C. Ancourt, F. Irigoin, M. Barreteau, J. Mattioli, and F. Paquier. A case study of design space exploration for embedded multimedia applications in SoCs. Technical Report A-361, CRI - École des Mines de Paris, february 2005.
14. U. Kapasi, S. Rixner, W. Dally, B. Khailany, J. Ho Ahn, P. Mattson, and J. Owens. Programmable stream processors. IEEE Computer, 36(8):54-62, august 2003.
15. W. Kelly and W. Pugh. A framework for unifying reordering transformations. Technical Report CS-TR-3193, University of Maryland, 1993.
16. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers'9 5 Symposium on the frontiers of massively parallel computation, McLean, 1995.
17. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons, Inc., 1978.
18. H. Le Verge. A note on Chernikova's algorithm. Technical Report 635, IRISA, 1992.
19. C. Lengauer. Loop parallelization in the polytope model. In Int. Conf. on Concurrency Theory, LNCS 715, pages 398-416, Hildesheim, August 1993.
20. W. Li and K. Pingali. A singular loop transformation framework based on nonsingular matrices. International Journal of Parallel Programming, 22(2):183-205, April 1994.
21. A. Lim and M. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. In PoPL'24 ACM Symp. on Principles of Programming Languages, pages 201-214, Paris, January 1997.
22. R. Müller-Pfefferkorn, W. Nagel, and B. Trenkler. Optimizing cache access: A tool for source-to-source transformations and real-life compiler tests. In Euro-Par 2004 Parallel Processing, 10th International Euro-Par Conference, pages 72-81, Pisa, august 2004.
23. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Proceedings of the third ACM/IEEE conference on Supercomputing, pages 4-13, Albuquerque, august 1991.
24. W. Pugh. Uniform techniques for loop optimization. In ICS'5 ACM International Conference on Supercomputing, pages 341-352, Cologne, June 1991.
25. 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.
26. J. Ramanujam. Beyond unimodular transformations. J. of Supercomputing, 9(4):365-389, 1995.
27. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, Inc., 1986.
28. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley, 1995.
29. J. Xue. Automating non-unimodular loop transformations for massive parallelism. Parallel Computing, 20(5):711-728, 1994.