Precise Miss Analysis for Program Transformations with Caches of Arbitrary Associativity (1998)
Cached
Download Links
- [www.ee.princeton.edu]
- [parapet.ee.princeton.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems |
| Citations: | 74 - 1 self |
BibTeX
@INPROCEEDINGS{Ghosh98precisemiss,
author = {Somnath Ghosh and Margaret Martonosi and Sharad Malik},
title = {Precise Miss Analysis for Program Transformations with Caches of Arbitrary Associativity},
booktitle = {In Proceedings of the Eighth International Conference on Architectural Support for Programming Languages and Operating Systems},
year = {1998},
pages = {228--239}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Analyzing and optimizing program memory performance is a pressing problem in high-performance computer architectures. Currently, software solutions addressing the processormemory performance gap include compiler- or programmerapplied optimizations like data structure padding, matrix blocking, and other program transformations. Compiler optimization can be effective, but the lack of precise analysis and optimization frameworks makes it impossible to confidently make optimal, rather than heuristic-based, program transformations. Imprecision is most problematic in situations where hard-to-predict cache conflicts foil heuristic approaches. Furthermore, the lack of a general framework for compiler memory performance analysis makes it impossible to understand the combined effects of several program transformations. The Cache Miss Equation (CME) framework discussed in this paper addresses these issues. We express memory reference and cache conflict behavior in terms of sets of equations. The ...
