A compiler technique for improving whole-program locality

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 179-192

  Kandemir, M T ^a  

^a The Pennsylvania State University   (United States)

Author keywords

Cache locality; Data reuse; Memory layouts; Optimizing compilers; Static optimizations

Indexed keywords

CACHE MEMORY; OPTIMIZATION; PROGRAM DIAGNOSTICS; PROGRAM TRANSLATORS;

CACHE LOCALITY; DATA REUSE; OPTIMIZING COMPILERS;

PROGRAM COMPILERS;

EID: 0035029828     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/360204.360219     Document Type: Conference Paper

References (46)

1. The SUIF compiler for scalable parallel machines
2. Data and computation transformations for multiprocessors
3. Reshaping access patterns for generating sparse codes
4. On a completion method for unimodular matrices
5. Data-distribution support on distributed-shared memory multi-processors
6. Optimal evaluation of array expressions on massively parallel machines
7. Unifying data and control transformations for distributed shared memory machines
8. Inter-procedural array re-mapping
9. Tile size selection using cache organization and data layout
10. A methodology for procedure cloning
11. Inter-array data regrouping
12. A novel approach towards automatic data distribution
13. Dynamic data distribution with control flow analysis
14. Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers
15. Precise miss analysis for program transformations with caches of arbitrary associativity
16. Detecting coarse-grain parallelism using an inter-procedural parallelizing compiler
17. An integer linear programming approach for optimizing cache locality
18. Locality optimization algorithms for compilation of out-of-core codes
19. A matrix-based approach to the global locality optimization problem
20. Improving locality using loop and data transformations in an integrated framework
21. A framework for inter-procedural locality optimization
22. A hyperplane based approach for optimizing spatial locality in loop nests
23. A compiler algorithm for optimizing locality in loop nests
24. The omega library interface guide
25. Automatic data layout for high performance fortran
26. Optimizing for parallelism and data locality
27. Data-centric multi-level blocking
28. The cache performance of blocked algorithms
29. Optimizing data locality by array restructuring
30. Compiling communication efficient programs for massively parallel machines
31. De-linearization: An efficient way to break multi-loop dependence equations
32. Improving data locality with loop transformations
33. NWChem: A computational chemistry package for parallel computers, version 1.1
34. Non-singular data transformations: Definition, validity, applications
35. Integrating loop and data transformations for global optimisation
36. Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers
37. Compile-time techniques for data distribution in distributed memory machines
38. Data transformations for eliminating conflict misses
39. Automatic partitioning of data and computations on scalable shared memory multiprocessors
40. A data locality optimizing algorithm
41. Combining loop transformations considering caches and scheduling