In search of a program generator to implement generic transformations for high-performance computing

Science of Computer Programming

Volumn 62, Issue 1, 2006, Pages 25-46

  Cohen, Albert ^a   Donadio, Sébastien ^b   Garzaran, Maria Jesus ^c   Herrmann, Christoph ^d   Kiselyov, Oleg ^e   Padua, David ^c  

^a INRIA   (France)

^b UNIVERSITY OF VERSAILLES   (France)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d UNIVERSITY OF PASSAU   (Germany)

^e FNMOC   (United States)

Author keywords

Adaptive libraries; Application specific program generators; Loop transformations; Multi stage programming

Indexed keywords

ABSTRACTING; AUTOMATIC PROGRAMMING; CODES (SYMBOLS); COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; MICROPROCESSOR CHIPS; OPTIMIZATION; SYNTACTICS;

ADAPTIVE LIBRARIES; APPLICATION-SPECIFIC PROGRAM GENERATORS; LOOP TRANSFORMATIONS; MULTI-STAGE PROGRAMMING;

MATHEMATICAL TRANSFORMATIONS;

EID: 33745665061     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.10.013     Document Type: Article

References (54)

1. Whaley R.C., Petitet A., and Dongarra J.J. Automated empirical optimizations of software and the ATLAS project. Parallel Comput. 27 1-2 (2001) 3-35
2. Kisuki T., Knijnenburg P., O'Boyle M., and Wijshoff H. Iterative compilation in program optimization. Proc. CPC'10, Compilers for Parallel Computers (2000) 35-44
3. Cooper K.D., Subramanian D., and Torczon L. Adaptive optimizing compilers for the 21st century. J. Supercomput. 23 1 (2002) 7-22
4. D. Parello, O. Temam, A. Cohen, J.-M. Verdun, Towards a systematic, pragmatic and architecture-aware program optimization process for complex processors, in: ACM Supercomputing'04, Pittsburgh, Pennsylvania, 2004, p. 15
5. Bik A.J.C., Girkar M., Grey P.M., and Tian X. Automatic intra-register vectorization for the Intel architecture. Int. J. Parallel Programming 30 2 (2002) 65-98
6. In: Lengauer C., Batory D., Consel C., and Odersky M. (Eds). Domain-Specific Program Generation. LNCS vol. 3016 (2003), Springer-Verlag
7. D.I. August, D.A. Connors, S.A. Mahlke, J.W. Sias, K.M. Crozier, B.-C. Cheng, P.R. Eaton, Q.B. Olaniran, W.-M. Hwu, Integrated predicated and speculative execution in the IMPACT EPIC architecture, in: Proceedings of the 25th Intl. Symp. on Computer Architecture, 1998, pp. 227-237
8. Rauchwerger L., and Padua D. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. Compilers and Languages for Parallel and Distributed Computers. IEEE Trans. Parallel Distrib. Syst. 10 2 (1999) 160-180 (special issue)
9. Cohen A., Girbal S., and Temam O. A polyhedral approach to ease the composition of program transformations. Euro-Par'04. LNCS vol. 3149 (2004), Springer-Verlag, Pisa, Italy 292-303
10. X. Li, M.-J. Garzaran, D. Padua, A dynamically tuned sorting library, in: ACM Conf. on Code Generation and Optimization, CGO'04, San Jose, CA, 2004, pp. 111-124
11. T. Veldhuizen, D. Gannon, Active libraries: Rethinking the roles of compilers and libraries, in: SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing, 1998, pp. 21-23
12. M.D. Smith, Overcoming the challenges to feedback-directed optimization, in: ACM SIGPLAN Workshop on Dynamic and Adaptive Compilation and Optimization, 2000, pp. 1-11 (Keynote Talk)
13. K. Yotov, X. Li, G. Ren, M. Cibulskis, G. DeJong, M. Garzaran, D. Padua, K. Pingali, P. Stodghill, P. Wu, A comparison of empirical and model-driven optimization, in: ACM Symp. on Programming Language Design and Implementation, PLDI'03, San Diego, CA, 2003, pp. 63-76
14. M. Frigo, S.G. Johnson, FFTW: An adaptive software architecture for the FFT, in: Proc. of the ICASSP Conf., vol. 3, 1998, pp. 1381-1384
15. De Rose L., and Padua D. Techniques for the translation of MATLAB programs into Fortran90. ACM Trans. Programming Languages Systems 21 2 (1999) 286-323
16. A. Chauhan, K. Kennedy, Optimizing strategies for telescoping languages: Procedure strength reduction and procedure vectorization, in: ACM Intl. Conf. on Supercomput., ICS'04, 2001, pp. 92-101
17. Püschel M., Singer B., Xiong J., Moura J., Johnson J., Padua D., Veloso M., and Johnson R.W. SPIRAL: A generator for platform-adapted libraries of signal processing algorithms. Automatic Performance Tuning. J. High Performance Computing and Applications 18 1 (2004) 21-45 (special Issue)
18. Open research compiler, http://ipf-orc.sourceforge.net
19. Merill J. GENERIC and GIMPLE: A new tree representation for entire functions. Proceedings of the 2003 GCC Developers Summit (2003) 171-180. http://www.gccsummit.org/2003
20. A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam, N. Vasilache, Facilitating the search for compositions of program transformations, in: ACM Intl. Conf. on Supercomputing, ICS'05, Boston, Massachusetts, 2005, pp. 151-160
21. K. Kennedy, Telescoping languages: A compiler strategy for implementation of high-level domain-specific programming systems, in: Proc. Intl. Parallel and Distributed Processing Symposium, IPIPS'00, 2000, pp. 297-304
22. C. Calcagno, W. Taha, L. Huang, X. Leroy, Implementing multi-stage languages using ASTs, Gensym, and reflection, in: ACM SIGPLAN/SIGSOFT Intl. Conf. Generative Programming and Component Engineering, GPCE'03, 2003, pp. 57-76
23. Ekhardt J., Kaiabachev R., Pašalić E., Swadi K., and Taha W. Implicitly heterogeneous multi-stage programming. ACM SIGPLAN/SIGSOFT Intl. Conf. Generative Programming and Component Engineering. GPCE'05. LNCS vol. 3676 (2005)
24. Quinlan D.J., Schordan M., Yi Q., and de Supinski B.R. Semantic-driven parallelization of loops operating on user-defined containers. Workshop on Languages and Compilers for Parallel Computing. LNCS vol. 2958 (2003), Springer-Verlag 524-538
25. O. Beckmann, A. Houghton, P.H.J. Kelly, M. Mellor, Run-time code generation in C++ as a foundation for domain-specific optimisation, in: Proceedings of the 2003 Dagstuhl Workshop on Domain-Specific Program Generation, 2003
26. W. Taha, A sound reduction semantics for untyped CBN mutli-stage computation. or, the theory of MetaML is non-trival, in: Proc. of the ACM workshop on Partial Evaluation and semantics-based Program Manipulation, PEPM'00, Boston, Massachusetts, 2000, pp. 34-43
27. W. Taha, M.F. Nielsen, Environment classifiers, in: ACM Symp. on Principles of Programming Languages, PoPL'03, 2003, pp. 26-37
28. Calcagno C., Moggi E., and Taha W. ML-like inference for classifiers. In: Schmidt D. (Ed). European Symposium on Programming. ESOP. LNCS vol. 2986 (2004), Springer-Verlag 79-93
29. Standard performance evaluation corporation, http://www.spec.org
30. KAP C/OpenMP for Tru64 UNIX and KAP DEC Fortran for Digital UNIX. http://www.hp.com/techsevers/software/kap.html
31. Allen R., and Kennedy K. Optimizing Compilers for Modern Architectures (2002), Morgan and Kaufman
32. Herrmann C.A., and Lengauer C. Parallelization of divide-and-conquer by translation to nested loops. J. Funct. Programming 9 3 (1999) 279-310
33. Herrmann C.A., and Lengauer C. HDC: A higher-order language for divide-and-conquer. Parallel Process. Lett. 10 2-3 (2000) 239-250
34. Herrmann C.A. Generating message-passing programs from abstract specifications by partial evaluation. Parallel Process. Lett. 15 3 (2005) 305-320
35. S. Liang, P. Hudak, M. Jones, Monad transformers and modular interpreters, in: ACM Symp. on Principles of Programming Languages, PoPL'95, 1995, pp. 333-343
36. Van Deursen A., Klint P., and Visser J. Domain-specific languages: An annotated bibliography. ACM SIGPLAN Notices 35 6 (2000) 26-36
37. O. Kiselyov, K.N. Swadi, W. Taha, A methodology for generating verified combinatorial circuits, in: Embedded Software Conf., EMSOFT'04, Pisa, Italy, 2004, pp. 249-258
38. Carette J., and Kiselyov O. Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. ACM SIGPLAN/SIGSOFT Intl. Conf. Generative Programming and Component Engineering. GPCE'05. LNCS vol. 3676 (2005)
39. Feautrier P. Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Int. J. Parallel Programming 21 6 (1992) 389-420 See also Part I, one dimensional time, 21(5):315-348
40. M.E. Wolf, Improving locality and parallelism in nested loops, Ph.D. Thesis, Stanford University, published as CSL-TR-92-538 (August 1992)
41. W. Kelly, Optimization within a unified transformation framework, Tech. Rep. CS-TR-3725, University of Maryland, 1996
42. C. Bastoul, A. Cohen, S. Girbal, S. Sharma, O. Temam, Putting polyhedral loop transformations to work, in: Workshop on Languages and Compilers for Parallel Computing, LCPC'03, LNCS, College Station, Texas, 2003, pp. 23-30
43. C. Bastoul, Code generation in the polyhedral model is easier than you think, in: Parallel Architectures and Compilation Techniques, PACT'04, Juan-les-Pins, 2004, pp. 7-16
44. Boulet P., and Redon X. SPPoC: Symbolic parameterized polyhedral calculator. http://www.lifl.fr/west/sppoc
45. Feautrier P. Parametric integer programming. RAIRO Recherche Opérationnelle 22 (1988) 243-268
46. V. Loechner, D. Wilde, Parameterized polyhedra and their vertices, Int. J. Parallel Programming 25 (6). http://icps.u-strasbg.fr/PolyLib
47. Pugh W. A practical algorithm for exact array dependence analysis. Comm. ACM 35 8 (1992) 27-47
48. P. Feautrier, Array expansion, in: ACM Intl. Conf. on Supercomputing, St. Malo, France, 1988, pp. 429-441
49. Darte A., Robert Y., and Vivien F. Scheduling and Automatic Parallelization (2000), Birkhaser, Boston
50. J. Llosa, Swing modulo scheduling: A lifetime-sensitive approach, in: Parallel Architectures and Compilation Techniques, PACT'96, 1996, pp. 80-87
51. Veldhuizen T. Using C++ template metaprograms. C++ Report 7 4 (1995) 36-43
52. Poletto M., Hsieh W.C., Engler D.R., and Kaashoek M.F. 'C and tcc: A language and compiler for dynamic code generation. ACM Trans. Programming Languages Systems 21 2 (1999) 324-369
53. Turner D.A. A new implementation technique for applicative languages. Software-Practice and Experience 9 1 (1979) 31-49
54. C. Lattner, V. Adve, LLVM: A compilation framework for lifelong program analysis & transformation, in: ACM Conf. on Code Generation and Optimization, CGO'04, San Jose, CA, 2004, pp. 75-88