Avoiding conflict misses dynamically in large direct-mapped caches

  • Authors:
  • Brian N. Bershad;Dennis Lee;Theodore H. Romer;J. Bradley Chen

  • Affiliations:
  • Department of Computer Science, and Engineering, University of Washington, Seattle, WA;Department of Computer Science, and Engineering, University of Washington, Seattle, WA;Department of Computer Science, and Engineering, University of Washington, Seattle, WA;School of Computer Science, and Engineering Carnegie Mellon University, 5000 Forbes Ave., Pittsburgh, PA

  • Venue:
  • ASPLOS VI Proceedings of the sixth international conference on Architectural support for programming languages and operating systems
  • Year:
  • 1994

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper describes a method for improving the performance of a large direct-mapped cache by reducing the number of conflict misses. Our solution consists of two components: an inexpensive hardware device called a Cache Miss Lookaside (CML) buffer that detects conflicts by recording and summarizing a history of cache misses, and a software policy within the operating system's virtual memory system that removes conflicts by dynamically remapping pages whenever large numbers of conflict misses are detected. Using trace-driven simulation of applications and the operating system, we show that a CML buffer enables a large direct-mapped cache to perform nearly as well as a two-way set associative cache of equivalent size and speed, although with lower hardware cost and complexity.