Enhancing spatial locality via data layout optimizations

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

Volumn 1470 LNCS, Issue , 1998, Pages 422-434

  Kandemir, M ^a   Choudhary, A ^b   Ramanujam, J ^c   Shenoy, N ^b   Banerjee, P ^b  

^a SYRACUSE UNIVERSITY   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MEMORY ARCHITECTURE; VECTORS;

DATA LAYOUT OPTIMIZATION; DISTRIBUTED SHARED MEMORY; ITERATION SPACES; LOCALITY OF REFERENCE; LOCALITY OPTIMIZATION; MEMORY LAYOUT; SPATIAL LOCALITY; SPATIAL REUSE;

VECTOR SPACES;

EID: 22044440681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057885     Document Type: Conference Paper

References (13)

1. J. Anderson, S. Amarasinghe, and M. Lam. Data and computation transformations for multiprocessors. Proc. 5th SIGPLAN Symp. Prin. & Prac. Para. Prog., Jul. 1995.
2. M. Cierniak, and W. Li. Unifying data and control transformations for distributed shared memory machines. Proc. SIGPLAN '95 Conf. Prog, Lang. Des.& Impl., Jun. 1995.
3. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformations, J. Para. & Dist. Comp., 5:587-616, 1988.
4. T. Jeremiassen, and S. Eggers. Reducing false sharing on shared memory multiprocessors through compile time data transformations. Proc. 5th SIGPLAN Symp. Prin. & Prac. Para. Prog., Jul. 1995.
5. M. Kandemir, J. Ramanujam, and A. Choudhary. Compiler algorithms for optimizing locality and parallelism on shared and distributed memory machines. Proc. 1997 International Conference on Parallel Architectures and Compilation Techniques, pp. 236-247, Nov. 1997.
6. M. Kandemir, A. Choudhary, N. Shenoy, P. Banerjee, and J. Ramanujam. A data layout optimization technique based on hyperplanes. TR CPDC-TR-97-04, Northwestern Univ.
7. M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee. Optimizing spatial locality in loop nests using linear algebra. Proc. 7th Workshop Compilers for Parallel Computers, 1998.
8. S-T. Leung, and J. Zahorjan. Optimizing data locality by array restructuring. Technical Report, CSE Dept., University of Washington, TR 95-09-01, Sep. 1995.
9. W. Li. Compiling for NUMA parallel machines. Ph.D. dissertation, Cornell University, 1993.
10. K. McKinley, S. Carr, and C.W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 1996.
11. M. 'Boyle, and P. Knijnenburg. Non-singular data transformations: Definition, validity, applications. Proc. 6th Workshop on Compilers for Parallel Computers, pp. 287-297, 1996.
12. J. Ramanujam, and P. Sadayappan. Compile-time techniques for data distribution in distributed memory machines. In IEEE Trans. Para. & Dist. Sys., 2(4):472-482, Oct. 1991.
13. M. Wolf, and M. Lam. A data locality optimizing algorithm. In Proc. ACM SIG-PLAN 91 Conf. Programming Language Design and Implementation, pp. 30-44, June 1991.