More legal transformations for locality

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

Volumn 3149, Issue , 2004, Pages 272-283

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

^a UNIVERSITY OF VERSAILLES   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPILER TECHNIQUES; COMPLEX PROBLEMS; DATA DEPENDENCE; DATA LOCALITY; PROGRAM TRANSFORMATIONS; RESTRUCTURING COMPILERS;

PROGRAM COMPILERS;

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

References (19)

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. U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing, pages 192-219, Irvine, august 1990.
3. 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.
4. 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.
5. 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.
6. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22(3):243-268, 1988.
7. P. Feautrier. Some efficient solutions to the affine scheduling problem: one dimensional time. International Journal of Parallel Programming, 21(5):313-348, October 1992.
8. 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.
9. 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.
10. 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.
11. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons, Inc., 1978.
12. C. Lengauer. Loop parallelization in the polytope model. In International Conference on Concurrency Theory, LNCS 715, pages 398-416, Hildesheim, August 1993.
13. W. Li and K. Pingali. A singular loop transformation framework based on nonsingular matrices. International Journal of Parallel Programming, 22(2): 183-205, April 1994.
14. 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.
15. A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986.
16. 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.
17. M. Wolfe. Iteration space tiling for memory hierarchies. In 3rd SIAM Conference on Parallel Processing for Scientific Computing, pages 357-361, december 1987.
18. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley Publishing Company, 1995.
19. J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409424, 1997.