Loading...
Selective prefetching: prefetching when only required
Pendse, Ravi Katta, H.
Pendse, Ravi
Katta, H.
Citations
Altmetric:
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
1999
Type
Conference paper
Genre
Keywords
Cache memory,Degradation,Delay,Floods,Frequency,Prefetching,Random access memory,System performance
Subjects (LCSH)
Citation
Pendse, R.; Katta, H.; , "Selective prefetching: prefetching when only required," Circuits and Systems, 1999. 42nd Midwest Symposium on, vol.2, no., pp.866-869, vol. 2, 1999. doi: 10.1109/MWSCAS.1999.867772
Abstract
Cache memories are commonly used to reduce the number of slower lower-level memory accesses, thereby improving the memory hierarchy performance. However, high cache miss-ratio can severely degrade system performance. It is therefore necessary to anticipate the cache misses to reduce their frequency. Prefetching, is one such technique, which allows memory systems to import data into the cache before the processor needs it. Aggressive prefetching can significantly reduce cache misses but may lead to cache pollution and also increase memory traffic. An innovative hardware-based prefetching technique is proposed which overcomes these problems while providing improved cache hit-rate. Our trace driven simulations show an improvement of around 60% in the miss rates for an instruction cache employing the LRU-FP block replacement algorithm with the proposed pre-fetch scheme as compared to the miss rates obtained due to a sequential prefetch mechanism
Table of Contents
Description
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954
Publisher
IEEE
Journal
Book Title
Series
Circuits and Systems, 1999. 42nd Midwest Symposium on;vol.2, no., pp.866-869