Automatic correction of loop transformations

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2007, Pages 292-302

  Vasilache, Nicolas ^a   Cohen, Albert ^a   Pouchet, Louis Noël ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

A POSTERIORI; AUTOMATIC CORRECTION; COMBINATORIAL PROBLEMS; COMPILATION TECHNIQUES; DECISION PROBLEMS; EXPERIMENTAL EVIDENCE; GENERAL METHOD; GEOMETRIC TRANSFORMATIONS; HARD PROBLEMS; INDEX-SET SPLITTING; INTERNATIONAL CONFERENCES; LOOP OPTIMIZATIONS; LOOP SHIFTING; LOOP TRANSFORMATIONS; MODERN ARCHITECTURES; NEW DESIGN; NON-LINEAR; OPTIMIZATION HEURISTICS; PARALLEL ARCHITECTURES; PARALLELIZING COMPILERS; PERFORMANCE IMPACTS; RESOURCE USAGE; SEARCH SPACES; SEMANTICAL CONSTRAINTS; TRANSFORMATION SEQUENCES;

CHLORINE COMPOUNDS; CODES (SYMBOLS); FINANCIAL DATA PROCESSING; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; SET THEORY; TURBO CODES;

MATHEMATICAL TRANSFORMATIONS;

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

References (27)

1. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan and Kaufman, 2002.
2. C. Bastoul. Code generation in the polyhedral model is easier than you think. In Parallel Architectures and Compilation Techniques (PACT'04), Antibes, France, Sept. 2004.
3. C. Bastoul and P. Feautrier. Adjusting a program transformation for legality. Parallel processing letters, 15(1):3-17, March 2005.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1989.
5. J. B. Crop and D. K. Wilde. Scheduling structured systems. In EuroPar'99, LNCS, pages 409-412, Toulouse, France, Sept. 1999. Springer-Verlag.
6. A. Darte and G. Huard. Loop shifting for loop parallelization. Intl. J. of Parallel Programming, 28(5):499-534, 2000.
7. A. Darte, G.-A. Silber, and F. Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling. Parallel Processing Letters, 7(4):379-392, 1997.
8. S. Donadio, J. Brodman, T. Roeder, K. Yotov, D. Barthou, A. Cohen, M. Garzaran, D. Padua, and K. Pingali. A language for the compact representation of multiple program versions. In Languages and Compilers for Parallel Computing (LCPC'05), LNCS, Hawthorne, New York, Oct. 2005. Springer-Verlag. 15 pages.
9. P. Feautrier. Array expansion. In ACM Intl. Conf. on Supercomputing, pages 429-441, St. Malo, France, July 1988.
10. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22:243-268, Sept. 1988.
11. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Intl. J. of Parallel Programming, 21(6):389-420, Dec. 1992. See also Part I, one dimensional time, 21(5):315-348.
12. P. Feautrier. Scalable and structured scheduling. To appear at Intl. J. of Parallel Programming, 28, 2006.
13. P. Feautrier, M. Griebl, and C. Lengauer. On index set splitting. In Parallel Architectures and Compilation Techniques (PACT'99), Newport Beach, CA, Oct. 1999. IEEE Computer Society.
14. S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies. Intl. J. of Parallel Programming, 2006. Special issue on Microgrids. 57 pages.
15. M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. Facultät für Mathematik und Informatik, Universität Passau, 2004.
16. W. Kelly. Optimization within a unified transformation framework. Technical Report CS-TR-3725, University of Maryland, 1996.
17. C. Lee and M. Stoodley. UTDSP benchmark suite, 1998. http://www.eecg. toronto.edu/corinna/DSP/.
18. C. E. Leiserson and J. B. Saxe. Retiming synchronous circuitry. Algorithmica, 6(1), 1991.
19. th ACM Symp. on Principles of Programming Languages, pages 201-214, Paris, France, jan 1997.
20. K. McKinley, S. Carr, and C.-W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, july 1996.
21. L.-N. Pouchet, C. Bastoul, A. Cohen, and N. Vasilache. Iterative optimization in the polyhedral model: Part I, one-dimensional time. In International Symposium on Code Generation and Optimization, pages 144-156, San Jose, California, Mar. 2007. IEEE Comp. Soc.
22. M. Püschel, B. Singer, J. Xiong, J. Moura, J. Johnson, D. Padua, M. Veloso, and R. W. Johnson. SPIRAL: A generator for platform-adapted libraries of signal processing algorithms. Journal of High Performance Computing and Applications, special issue on Automatic Performance Tuning, 18(1):21-45, 2004.
23. F. Quilleré and S. Rajopadhye. Optimizing memory usage in the polyhedral model. Technical Report 1228, IRISA, Université de Rennes, France, Jan. 1999.
24. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. Intl. J. of Parallel Programming, 28(5):469-498, Oct. 2000.
25. N. Vasilache, A. Cohen, C. Bastoul, and S. Girbal. Violated dependence analysis. In ACM Intl. Conf. on Supercomputing (ICS'06), Cairns, Australia, June 2006.
26. S. Verdoolaege, M. Bruynooghe, G. Janssens, and F. Catthoor. Multi-dimensional incremental loops fusion for data locality. In ASAP, pages 17-27, 2003.
27. M. E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Aug. 1992. Published as CSL-TR-92-538.