|
Abstract : |
With the widening performance gap between processors and main memory, efficient memory accessing behavior is neces-sary for good program performance. Both hand-tuning and compiler optimization techniques are often used to trans-form codes to improve memory performance. Effective trans-formations require detailed knowledge about the frequency and causes of cache misses in the code. This paper describes methods for generating and solving Cache Miss equations that give a detailed representation of the cache misses in loop-oriented scientific code. Imple-mented within the SUIF compiler framework, our approach extends on traditional compiler reuse analysis to generate linear Diophantine equations that summarize each loop?s memory behavior. Mathematical techniques for msnipulat-, |
