Facilitating the search for compositions of program transformations

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2005, Pages 151-160

  Cohen, Albert ^a   Girbal, Sylvain ^a,b   Parello, David ^a,c   Sigler, Marc ^a   Temam, Olivier ^a   Vasilache, Nicolas ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CEA LIST   (France)

^c HP France   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; OPTIMIZATION; PROGRAM COMPILERS; REAL TIME SYSTEMS; SCHEDULING; SEMANTICS;

COMPLEX RUN-TIME BEHAVIOR; PROGRAM TRANSFORMATIONS; RIGID PHASE ORDERING; STATIC COMPILER OPTIMIZATIONS;

COSINE TRANSFORMS;

EID: 32844473507     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088149.1088169     Document Type: Conference Paper

References (36)

1. N. Ahmed, N. Mateev, and K. Pingali. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. In ACM Supercomputing'00, May 2000.
2. C. Ancourt and F. Irigoin. Scanning polyhedra with DO loop. In ACM Symp. on Principles and Practice of Parallel Programming (PPoPP' 91), pages 39-50, June 1991.
3. C. Bastoul. Code generation in the polyhedral model is easier than you think. In Parallel Architectures and Compilation Techniques (PACT04), Sept. 2004.
4. C. Bastoul and P. Feautrier. Improving data locality by chunking. In CC' 12 Intl. Conference on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, Poland, april 2003.
5. C. Bastoul and P. Feautrier. More legal transformations for locality. In Euro-Par'10, number 3149 in LNCS, pages 272-283, Pisa, Aug. 2004.
6. C. Bell, W.-Y. Chen, D. Bonachea, and K. Yelick. Evaluating support for global address space languages on the cray XI. In ACM Int. Conf. on Supercomputing (ICS'04), St-Malo, France, June 2004.
7. W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoefinger, D. Padua, P. Petersen, W. Pottenger, L. Rauchwerger, P. Tu, and S. Weatherford. Parallel programming with Polaris. IEEE Computer, 29(12):78-82, Dec. 1996.
8. F. Chow. Maximizing application performance through interprocedural optimization with the pathscale eko compiler suite, http: //www.pathscale.com/ whitepapers.html, Aug. 2004.
9. C. Coarfa, F. Zhao, N. Tallent, J. Mellor-Crummey, and Y. Dot-senko. Open-source compiler technology for source-to-source optimization. http://www.cs.rice.edu/~johnmc/research.html (project page).
10. A. Cohen, S. Girbal, and O. Temam. A polyhedral approach to ease the composition of program transformations. In Euro-Par'04, number 3149 in LNCS, Pisa, Italy, Aug. 2004. Springer-Verlag.
11. K. D. Cooper, M. W. Hall, R. T. Hood, K. Kennedy, K. S. McKinley, J. M. Mellor-Crummey, L. Torczon, and S. K. Warren. The ParaS-cope parallel programming environment. Proceedings of the IEEE, 81(2):244-263, 1993.
12. K. D. Cooper, D. Subramanian, and L. Torczon. Adaptive optimizing compilers for the 21st century. J. of Supercomputing, 2002.
13. P. Feautrier. Some effi cient solutions to the affi ne scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6):389-420, Dec. 1992.
14. See also Part I, one dimensional time. Int. J. of Parallel Programming, 21(5):315-348.
15. M. Hall et al. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, 29(12):84-89, Dec. 1996.
16. F. Irigoin, P. Jouvelot, and R, Triolet. Semantical interprocedural parallelization: An overview of the pips project. In ACM Int. Conf. on Supercomputing (ICS'2), Cologne, Germany, June 1991.
17. KAP C/OpenMP for Tru64 UNIX and KAP DEC Fortran for Digital UNIX, http://www.hp.com/techsevers/software/kap.html.
18. W. Kelly. Optimization within a unifi ed transformation framework. Technical Report CS-TR-3725, University of Maryland, 1996.
19. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers'95 Symp. on the frontiers of massively parallel computation, McLean, 1995.
20. T. Kisuki, P. Knijnenburg, K. Gallivan, and M. O'Boyle. The effect of cache models on iterative compilation for combined tiling and unrolling. In Parallel Architectures and Compilation Techniques (PACT'00). IEEE Computer Society Press, Oct. 2001.
21. T. Kisuki, P. Knijnenburg, M. O'Boyle, and H. Wijshoff. Iterative compilation in program optimization. In Proc. CPC'10 (Compilers for Parallel Computers), pages 35-44, 2000.
22. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. Intl. J. of Parallel Programming, 22(2):183-205, April 1994.
23. h ACM Symp. on Principles of Programming Languages, pages 201-214, Paris, France, Jan 1997.
24. A. W. Lim, S.-W. Liao, and M. S. Lam. Blocking and array contraction across arbitrarily nested loops using affi ne partitioning. In ACM Symp. on Principles and Practice of Parallel Programming (PPoPP' 01), pages 102-112, 2001.
25. S. Long and M. O'Boyle. Adaptive java optimisation using instance-based learning. In ACM Int. Conf. on Supercomputing (ICS'04), pages 237-246, St-Malo, France, June 2004.
26. M. O'Boyle. MARS: a distributed memory approach to shared memory compilation. In Proc. Language, Compilers and Runtime Systems for Scalable Computing, Pittsburgh, May 1998. Springer-Verlag.
27. M. O'Boyle, P. Knijnenburg, and G. Fursin. Feedback assisted iterative compiplation. In Proc. LCR, 2000.
28. Open research compiler, http://ipf-orc.sourceforge.net.
29. D. Parello, O. Temam, A. Cohen, and J.-M. Verdun. Towards a systematic, pragmatic and architecture-aware program optimization process for complex processors. In ACM Supercomputing'04, Pittsburgh, Pennsylvania, Nov. 2004.
30. D. Parello, O. Temam, and J.-M. Verdun. On increasing architecture awareness in program optimizations to bridge the gap between peak and sustained processor performance? matrix-multiply revisited. In SuperComputing'02, Baltimore, Maryland, Nov. 2002.
31. G.-R. Perrin and A. Darte, editors. The Data Parallel Programming Model. Number 1132 in LNCS. Springer-Verlag, 1996.
32. A. Phansalkar, A. Joshi, L. Eeckhout, and L. John. Four generations of SPEC CPU benchmarks: what has changed and what has not. Technical Report TR-041026-01-1, University of Texas Austin, 2004.
33. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of effi cient nested loops from polyhedra. Intl. J. of Parallel Programming, 28(5):469-498, Oct. 2000.
34. Standard performance evaluation corp. http://www.spec.org.
35. M. E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Aug. 1992. Published as CSL-TR-92-538.
36. K. Yotov, X. Li, G. Ren, M. Cibulskis, G. DeJong, M. Garzaran, D. Padua, K. Pingali, P. Stodghill, and P. Wu. A comparison of empirical and model-driven optimization. In ACM Symp. on Programming Language Design and Implementation (PLDI'03), San Diego, CA, June 2003.