• Summary
• Related Documents
  • Active Bibliography
  • Co-citation
• Version History

Popular Tags

No tags have been applied to this document.

Add a tag:

BibTeX | Add To MetaCart

@INPROCEEDINGS{Ghosh97cachemiss,
    author = {Somnath Ghosh and Margaret Martonosi and Sharad Malik},
    title = {Cache miss equations: An analytical representation of cache misses},
    booktitle = {In Proceedings of the 1997 ACM International Conference on Supercomputing},
    year = {1997},
    pages = {317--324},
    publisher = {ACM Press}
}

Years of Citing Articles

Abstract:

With the widening performance gap between processors and main memory, efficient memory referencing behavior is necessary for good program performance. Both hand-tuning and compiler optimization techniques are often used to transform codes in ways that improve memory performance. In either case, however, effective transformations 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. Implemented 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 manipulating Diophantine equations allow us to compute the number of possible solutions, where each solution corresponds to a potential cache miss. These equations provide a general framework to guide code optimizations for improving cache performance. The paper gives an example of their use to determine array padding and offset amounts that minimize cache misses. Overall, these equations represent an analysis framework that is more precise than traditional memory behavior heuristics, but that can also be faster than simulation. 1

Citations