Precise miss analysis for program transformations with caches of arbitrary associativity

Research output: Chapter in Book/Report/Conference proceedingConference contribution

55 Scopus citations

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 languageEnglish (US)
Title of host publicationInternational Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS
PublisherAssociation for Computing Machinery
Pages228-239
Number of pages12
StatePublished - Jan 1 1998
EventProceedings of 1998 8th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-8 - San Jose, CA, USA
Duration: Oct 3 1998Oct 7 1998

Other

OtherProceedings of 1998 8th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS-8
CitySan Jose, CA, USA
Period10/3/9810/7/98

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Precise miss analysis for program transformations with caches of arbitrary associativity'. Together they form a unique fingerprint.

  • Cite this

    Ghosh, S., Martonosi, M. R., & Malik, S. (1998). Precise miss analysis for program transformations with caches of arbitrary associativity. In International Conference on Architectural Support for Programming Languages and Operating Systems - ASPLOS (pp. 228-239). Association for Computing Machinery.