Optimal mapping in direct mapped cache environments

S. Gal, Y. Hollander, A. Itai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In this paper we study positioning strategies for improving the performance of a memory system with a direct mapped cache. A positioning technique determines for every program item, (instruction or data), its address in main memory. Assuming the Independent Reference Model, we break the general positioning problem into two: the collision minimization, and the grouping problems; and show optimal algorithms for both problems. Using these algorithms we derive an optimal algorithm for the general positioning problem. Also, we show that the quality of a class of natural assignments that distribute the items almost arbitrarily is good as long as the optimal hit ratio is sufficiently large. For the case of more restricted positionings, we find an optimal assignment for the special case of the pair assignment. In addition we look at the expected performance gain of two frequently suggested cache features. The cache bypass feature supports the access of items in memory without loading the item into the cache. We show an assignment with best possible hit ratio which is almost always better then the optimal hit ratio. Also, it is shown that a random cache which alters the assignment of an item randomly cannot improve the expected hit ratio. These optimal positioning algorithms can be easily integrated into an optimizing compiler. The access probabilities can be estimated statically by sophisticated compilation techniques or dynamically from traces. For programs that implement accesses to a data structure where the current step is independent of previous steps it seems that optimal hit ratio can be achieved.

Original languageEnglish
Title of host publicationTheory of Computing and Systems - ISTCS 1992, Israel Symposium, Proceedings
EditorsDanny Dolev, Zvi Galil, Zvi Galil, Michael Rodeh
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540555537
StatePublished - 1992
Externally publishedYes
EventIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992 - Haifa, Israel
Duration: 27 May 199228 May 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume601 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceIsrael Symposium on the Theory of Computing and Systems, ISTCS 1992

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1992.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Optimal mapping in direct mapped cache environments'. Together they form a unique fingerprint.

Cite this