Adjusting a program transformation for legality

Parallel Processing Letters

Volumn 15, Issue 1-2, 2005, Pages 3-17

  Bastoul, Cédric ^a   Feautrier, Paul ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b UNIV LYON   (France)

Author keywords

Dependences; Legality; Locality; Polyhedral model; Program transformations

Indexed keywords

DATA REDUCTION; ERROR ANALYSIS; LEGACY SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM COMPILERS; REAL TIME SYSTEMS;

DEPENDENCES; LEGALITY; LOCALITY; POLYHEDRAL MODELS; PROGRAM TRANSFORMATIONS;

PROGRAM TRANSLATORS;

EID: 23844432663     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626405002027     Document Type: Conference Paper

References (28)

1. N. Ahmed, N. Mateev, and K. Pingali. Tiling imperfectly-nested loop nests. In SC'2000 High Performance Networking and Computing, Dallas, November 2000.
2. J. Allen and K. Kennedy. Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987.
3. U. Banerjee. Data dependence in ordinary programs. Master's thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, November 1976.
4. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.
5. U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing, pages 192-219, Irvine, August 1990.
6. C. Bastoul. Efficient code generation for automatic parallelization and optimization. In ISPDC'03 IEEE International Symposium on Parallel and Distributed Computing, pages 23-30, Ljubljana, October 2003.
7. C. Bastoul, A. Cohen, S. Girbal, S. Sharma, and O. Temam. Putting polyhedral transformations to work. In LCPC'16 International Workshop on Languages and Compilers for Parallel Computers, LNCS 2958, pages 209-225, College Station, October 2003.
8. C. Bastoul and P. Feautrier. Improving data locality by chunking. In CC'12 International Conference on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, April 2003.
9. A. Bernstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, 15(5):757-763, October 1966.
10. A. Cohen, S. Girbal, and O. Temam. A polyhedral approach to ease the composition of program transformations. In Euro-Par'10 International Euro-Par Conference, Pisa, August 2004.
11. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22(3):243-268, 1988.
12. P. Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, February 1991.
13. P. Feautrier. Some efficient solutions to the affine scheduling problem: one dimensional time. International Journal of Parallel Programming, 21(5):313-348, October 1992.
14. M. Griebl, P. Faber, and C. Lengauer. Space-time mapping and tiling - a helpful combination. Concurrency and Computation: Practice and Experience, 16(3):221-246, march 2004.
15. M. Griebl, C. Lengauer, and S. Wetzel. Code generation in the polytope model. In PACT'98 International Conference on Parallel Architectures and Compilation Techniques, pages 106-111, 1998.
16. F. Irigoin and R. Triolet. Computing dependence direction vectors and dependence cones with linear systems. Technical Report ENSMP-CAI-87-E94, Ecole des Mines de Paris, Fontainebleau (France), 1987.
17. I. Kodukula, N. Ahmed, and K. Pingali. Data-centric multi-level blocking. In ACM SIGPLAN'97 Conference on Programming Language Design and Implementation, pages 346-357, Las Vegas, June 1997.
18. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons. Inc., 1978.
19. C. Lengauer. Loop parallelization in the polytope model. In International Conference on Concurrency Theory, LNCS 715, pages 398-416, Hildesheim. August 1993.
20. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. International Journal of Parallel Programming, 22(2):183-205, April 1994.
21. K. McKinley, S. Carr, and C. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, July 1996.
22. D. Padua and M. Wolf. Advanced compiler optimizations for supercomputers. Communications of the ACM, 29(12):1184-1201, December 1996.
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. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986.
25. M. Wolf and M. Lam. A data locality optimizing algorithm. In ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 30-44, New York, June 1991.
26. M. Wolfe. Iteration space tiling for memory hierarchies. In 3rd SIAM Conference on Parallel Processing for Scientific Computing, pages 357-361, December 1987.
27. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley Publishing Company, 1995.
28. J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409-424, 1997.