A polyhedral approach to ease the composition of program transformations

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

Volumn 3149, Issue , 2004, Pages 292-303

  Cohen, Albert ^a   Girbal, Sylvain ^a,b   Temam, Olivier ^a  

^a INRIA   (France)

^b CEA LIST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; ITERATIVE METHODS;

GENERALIZED TRANSFORMATION; INDEPENDENT COMPONENTS; ITERATIVE OPTIMIZATION; POLYHEDRAL APPROACH; POLYHEDRAL REPRESENTATION; PROGRAM REPRESENTATIONS; PROGRAM TRANSFORMATIONS; RESTRUCTURING COMPILERS;

MULTITASKING;

EID: 35048850130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27866-5_38     Document Type: Article

References (28)

1. M. Barreteau, F. Bodin, Z. Chamski, H.-P. Charles, G. Eisenbeis, J. R. Gurd, J. Hoogerbrugge, P. Hu, W. Jalby, T. Kisuki, P. M. W. Knijnenburg, P. van der Mark, A. Nisbet, M. P. P. O'Boyle, E. Rohou, A. Seznec, E. Stöhr, M. Treffers, and H. A. G. Wijshoff. Oceans - optimising compilers for embedded applications. In Euro-Par'99, pages 1171-1775, Aug. 1999.
2. D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. J. of Parallel and Distributed Computing, 40:210-226, 1997.
3. C. Bastoul. Efficient code generation for automatic parallelization and optimization. In ISPDC'2 IEEE International Symposium on Parallel and Distributed Computing, Ljubjana, Slovenia, Oct. 2003.
4. C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam. Putting polyhedral loop transformations to work. In Workshop on Languages and Compilers for Parallel Computing (LCPC'03), LNCS, College Station, Texas, Oct. 2003.
5. W. Blume, R. Eigenmann, K. Faigin, J. Grout, J. Hoeflinger, 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.
6. A. Cohen, S. Girbal, and O. Temam. Facilitating the exploration of compositions of program transformations. Research report 5114, INRIA Futurs, France, Feb. 2004.
7. K. D. Cooper, M. W. Hall, R. T. Hood, K. Kennedy, K. S. McKinley, J. M. MellorCrummey, L. Torczon, and S. K. Warren. The ParaScope parallel programming environment. Proceedings of the IEEE, 81(2):244-263, 1993.
8. K. D. Cooper, D. Subramanian, and L. Torczon. Adaptive optimizing compilers for the 21st century. J. of Supercomputing, 2002.
9. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhauser, Boston, 2000.
10. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6):389-420, Dec. 1992.
11. See also Part I, one dimensional time, Int. J. of Parallel Programming 21(5):315-348.
12. th Workshop on Languages and Compilers for Parallel Computing, LNCS, Washington DC, July 2002. Springer-Verlag.
13. A.-C. Guillou, F. Quilleré P. Quinton, S. Rajopadhye, and T. Risset. Hardware design methodology with the Alpha language. In FDL'01, Lyon, France, Sept. 2001.
14. M. Hall et al. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, 29(12):84-89, Dec. 1996.
15. 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.
16. W. Kelly. Optimization within a unified transformation framework. Technical Report CS-TR-3725, University of Maryland, 1996.
17. 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.
18. I. Kodukula and K. Pingali. Transformations for imperfectly nested loops. In Supercomputing (SC'96), Jan. 1996.
19. th ACM Symp. on Principles of Programming Languages, pages 201-214, Paris, France, jan 1997.
20. A. W. Lim, S.-W. Liao, and M. S. Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In ACM Symp. on Principles and Practice of Parallel Programming (PPoPP'Ol, pages 102-112, 2001.
21. V. Loechner and D. Wilde. Parameterized polyhedra and their vertices. Int. J. of Parallel Programming, 25(6), Dec. 1997. http://icps.u-strasbg.fr/ PolyLib.
22. 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.
23. 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.
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. R. Schreiber, S. Aditya, B. Rau, V. Kathail, S. Mahlke, S. Abraham, and G. Snider. High-level synthesis of nonprogrammable hardware accelerators. Technical report, Hewlett-Packard, May 2000.
26. M. E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Aug. 1992. Published as CSL-TR-92-538.
27. M. J. Wolfe. High Performance Compilers for Parallel Computing. AddisonWesley, 1996.
28. D. Wonnacott and W. Pugh. Nonlinear array dependence analysis. In Proc. Third Workshop on Languages, Compilers and Run-Time Systems for Scalable Computers, 1995. Troy, New York.