Cache-conscious data placement
Brad Calder, Chandra Krintz, Simmi John et al. · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · 1998
As the gap between memory and processor speeds continues to widen, cache eficiency is an increasingly important component of processor performance. Compiler techniques have been used to improve instruction cache pet$ormance by mapping code with temporal locality to different cache blocks in the virtual address space eliminating cache conflicts. These code placement techniques can be applied directly to the problem of placing data for improved data cache pedormance.In this paper we present a general framework for Cache Conscious Data Placement. This is a compiler directed approach that creates an address placement for the stack (local variables), global variables, heap objects, and constants in order to reduce data cache misses. The placement of data objects is guided by a temporal relationship graph between objects generated via profiling. Our results show that profile driven data placement significantly reduces the data miss rate by 24% on average.
Cited by 268 works. doi:10.1145/291069.291036 Open-access PDF
Authors
References
- ATOM
- Improving direct-mapped cache performance by the addition of a small fully-associative cache prefetch buffers
- Design and evaluation of a compiler algorithm for prefetching
- Evaluating associativity in CPU caches
- Scout: a communications-oriented operating system
- Profile guided code positioning
- Achieving high instruction cache performance with an optimizing compiler
- Procedure merging with instruction caches
- Tradeoffs in Two-Level On-Chip Caching
- Decoupled access/execute computer architectures