Cache Replacement with Dynamic Exclusion (1991)
Download From
IEEE
Download Links
- [ftp.digital.com]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 19th Annual International Symposium on Computer Architecture |
| Citations: | 37 - 0 self |
BibTeX
@INPROCEEDINGS{McFarling91cachereplacement,
author = {Scott McFarling},
title = {Cache Replacement with Dynamic Exclusion},
booktitle = {In Proceedings of the 19th Annual International Symposium on Computer Architecture},
year = {1991},
pages = {191--200}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Most recent cache designs use direct-mapped caches to provide the fast access time required by modern high speed CPU's. Unfortunately, directmapped caches have higher miss rates than set-associative caches, largely because direct-mapped caches are more sensitive to conflicts between items needed frequently in the same phase of program execution. This paper presents a new technique for reducing direct-mapped cache misses caused by conflicts for a particular cache line. A small finite state machine recognizes the common instruction reference patterns where storing an instruction in the cache actually harms performance. Such instructions are dynamically excluded, that is they are passed directly through the cache without being stored. This reduces misses to the instructions that would have been replaced. The effectiveness of dynamic exclusion is dependent on the severity of cache conflicts and thus on the particular program and cache size of interest. However, across the SPE...
