Run-time adaptive cache hierarchy management via reference analysis

Teresa L. Johnson, Wen mei W. Hwu

Research output: Contribution to journalConference articlepeer-review


Improvements in main memory speeds have not kept pace with increasing processor clock frequency and improved exploitation of instruction-level parallelism. Consequently, the gap between processor and main memory performance is expected to grow, increasing the number of execution cycles spent waiting for memory accesses to complete. One solution to this growing problem is to reduce the number of cache misses by increasing the effectiveness of the cache hierarchy. In this paper we present a technique for dynamic analysis of program data access behavior, which is then used to proactively guide the placement of data within the cache hierarchy in a location-sensitive manner. We introduce the concept of a macroblock, which allows us to feasibly characterize the memory locations accessed by a program, and a Memory Address Table, which performs the dynamic reference analysis. Our technique is fully compatible with existing Instruction Set Architectures. Results from detailed simulations of several integer programs show significant speedups.

Original languageEnglish (US)
Pages (from-to)315-326
Number of pages12
JournalConference Proceedings - Annual International Symposium on Computer Architecture, ISCA
StatePublished - 1997
EventProceedings of the 1997 24th Annual International Symposium on Computer Architecture - Denver, CO, USA
Duration: Jun 2 1997Jun 4 1997

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Run-time adaptive cache hierarchy management via reference analysis'. Together they form a unique fingerprint.

Cite this