Maximum and Sorted Cache Occupation Using Array Padding
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 178-185
Abstract
The paper describes a framework for analyzing the cache content on affine references to arrays in loops. The framework is based on a small set of key cache parameters. We study the relation between these cache parameters and the data memory layout of arrays to demonstrate how to use array padding (static array re-dimensioning) to optimize the use of the cache. Based on the cache model we present a method to carry out intra-array padding for a maximum cache occupation and for a maximum sorted cache occupation, and a simple method to carry out inter-array padding. We also present an experimental evaluation of our techniques using a cache simulator and actual code executions on the MIPS R10K processor.Keywords
This publication has 8 references indexed in Scilit:
- Improving locality using loop and data transformations in an integrated framework2002
- Data relation vectors: a new abstraction for data optimizationsIEEE Transactions on Computers, 2001
- Automatic memory layout transformations to optimize spatial locality in parameterized loop nestsACM SIGARCH Computer Architecture News, 2000
- Cache miss equationsACM Transactions on Programming Languages and Systems, 1999
- An integer linear programming approach for optimizing cache locality1999
- Precise miss analysis for program transformations with caches of arbitrary associativity1998
- Data transformations for eliminating conflict misses1998
- Compiler transformations for high-performance computingACM Computing Surveys, 1994