Improving Locality Using Loop and Data Transformations in an Integrated Framework
Mahmut Kandemir, Alok Choudhary, Jagannathan Ramanujam et al. · 1998
This paper presents a new integrated compiler framework for improving the cache performance of scientific applications. In addition to applying loop transformations, the method includes data layout optimizations, i.e., those that change the memory layouts of data structures (arrays in this case). A key characteristic of this approach is that loop transformations are used to improve temporal locality while data layout optimizations are used to improve spatial locality. This optimization framework was used with sixteen loop nests from several benchmarks and math libraries, and the performance was measured using a cache simulator in addition to using a single node of the SGI Origin 2000 distributed-shared-memory machine for measuring actual execution times. The results demonstrate that this approach is very effective in improving locality and outperforms current solutions that use either loop or data transformations alone. We expect that our solution will also enable better register usage...
Cited by 102 works.
Authors
References
- Theory of Linear and Integer Programming
- A data locality optimizing algorithm
- The cache performance and optimizations of blocked algorithms
- High-Performance Compilers for Parallel Computing
- Evaluating associativity in CPU caches
- Strategies for cache and local memory management by global program transformation
- Supernode partitioning
- Tile size selection using cache organization and data layout
- Compiler optimizations for improving data locality
- Data and computation transformations for multiprocessors