Abstract
A cache miss equation (CME) framework addresses the problems in analyzing and optimizing program memory performance in high-performance computer architectures. The memory reference and cache conflict behavior are expressed in terms of sets of equations. The mathematical precision of CMEs allows to find true optimal solutions for transformations like blicking and padding. The generality of CMEs allow to reason about interactions between transformations applied in concert. This framework applies to caches of arbitrary associativity.
| Original language | English (US) |
|---|---|
| Pages | 228-239 |
| Number of pages | 12 |
| State | Published - 1998 |
| Event | Proceedings of 1998 8th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-8 - San Jose, CA, USA Duration: Oct 3 1998 → Oct 7 1998 |
Other
| Other | Proceedings of 1998 8th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-8 |
|---|---|
| City | San Jose, CA, USA |
| Period | 10/3/98 → 10/7/98 |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Hardware and Architecture