Improving data locality by chunking

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

Volumn 2622, Issue , 2003, Pages 320-334

  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

ALGORITHMS; ENERGY DISSIPATION; HEURISTIC METHODS; HEURISTIC PROGRAMMING; OPTIMIZATION;

ASYMPTOTIC EVALUATION; EXPERIMENTAL EVIDENCE; NON-TRIVIAL PROGRAMS; OPTIMIZATION ALGORITHMS; POTENTIAL BENEFITS; PROGRAM OPTIMIZATION; PROGRAM TRANSFORMATIONS; TEMPORAL AND SPATIAL;

CACHE MEMORY;

EID: 35248818778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36579-6_23     Document Type: Article

References (17)

1. E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. D. Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen. LAPACK User's Guide, Third Edition. SIAM, 1999.
2. U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing, pages 192-219, Irvine, august 1990.
3. F. Catthoor, S. Wuytack, E. De Greef, F. Balasa, L. Nachtergaele, and A. Vandecappelle. Custom memory managament methodology. Kluwer Academic, 1998.
4. S. Coleman and K. McKinley. Tile size selection using cache organization and data layout. In ACM SIGPLAN'95 Conference on Programming Language Design and Implementation, pages 279-290, La Jolla, june 1995.
5. P. Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(1):23-53, february 1991.
6. P. Feautrier. Some efficient solutions to the affine scheduling problem, part I: one dimensional time. International Journal of Parallel Programming, 21(5):313-348, october 1992.
7. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memories management by global program transformation. Journal of Parallel and Distributed Computing, (5):587-616, 1988.
8. M. Kandemir, J. Ramanujam, and A. Choudhary. Improving cache locality by a combination of loop and data transformations. IEEE Transactions on Computers, 48(2):159-167, february 1999.
9. 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.
10. D. Kuck. The Structure of Computers and Computations. John Wiley & Sons, Inc., 1978.
11. W. Li. Compiling for NUMA parallel machines. PhD thesis, Cornell Univ., 1993.
12. V. Loechner, B. Meister, and P. Clauss. Precise data locality optimization of nested loops. Journal of Supercomputing, 21(1):37-76, January 2002.
13. 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.
14. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5):469-498, october 2000.
15. 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.
16. M. Wolfe. Iteration space tiling for memory hierarchies. In 3rd SIAM Conference on Parallel Processing for Scientific Computing, pages 357-361, december 1987.
17. J. Xue. Transformations of nested loops with non-convex iteration spaces. Parallel Computing, 22(3):339-368, 1996.