{"title":"Avoiding conflict misses dynamically in large direct-mapped caches","authors":"B. Bershad, Dennis Lee, T. Romer, J. B. Chen","doi":"10.1145/195473.195527","DOIUrl":null,"url":null,"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.","PeriodicalId":140481,"journal":{"name":"ASPLOS VI","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"191","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ASPLOS VI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/195473.195527","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 191
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.
本文描述了一种通过减少冲突未命中次数来提高大型直接映射缓存性能的方法。我们的解决方案由两个组件组成:一个称为Cache Miss Lookaside (CML)缓冲区的廉价硬件设备,它通过记录和汇总缓存丢失的历史记录来检测冲突,以及操作系统虚拟内存系统中的软件策略,当检测到大量冲突丢失时,该策略通过动态重新映射页面来消除冲突。通过对应用程序和操作系统的跟踪驱动模拟,我们表明,CML缓冲区使大型直接映射缓存的性能几乎与同等大小和速度的双向集合关联缓存一样好,尽管硬件成本和复杂性较低。