Loading...
Pre-fetching with the segmented LRU algorithm
Pendse, Ravi Bhagavathula, Ravi
Pendse, Ravi
Bhagavathula, Ravi
Citations
Altmetric:
Authors
Other Names
Location
Time Period
Advisors
Original Date
Digitization Date
Issue Date
1999
Type
Conference paper
Genre
Keywords
Cache memory,Floods,Hard disks,Microprocessors,Power generation economics,Yarn
Subjects (LCSH)
Citation
Pendse, R.; Bhagavathula, R.; , "Pre-fetching with the segmented LRU algorithm," Circuits and Systems, 1999. 42nd Midwest Symposium on, vol.2, no., pp.862-865 vol. 2, 1999 doi: 10.1109/MWSCAS.1999.867771
Abstract
An economical solution to the need for unlimited amounts of fast memory is a memory hierarchy, which takes advantage of locality and cost/performance of memory technologies. Most of the advanced block replacement algorithms exploit the presence of temporal locality in programs towards a better performing cache. A direct fallout of this approach is the increased overhead involved due to the complexity of the algorithm without any drastic improvement in the cache performance. The performance of the cache could be improved if spatial locality present in the programs is further exploited. Prefetching of data into the cache even before it is requested is considered to be an effective means of improving the utilization of spatial locality within a stream of references. The Segmented-LRU (S-LRU) algorithm is an advanced block replacement algorithm that reduces the problem of flooding in the cache. This paper investigates the impact of pre-fetching on a cache employing the S-LRU block replacement algorithm
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.862-865