Pre-fetching with the segmented LRU algorithm

SOAR Repository

Show simple item record

dc.contributor.author Pendse, Ravi
dc.contributor.author Bhagavathula, Ravi
dc.date.accessioned 2011-09-20T16:27:42Z
dc.date.available 2011-09-20T16:27:42Z
dc.date.issued 1999
dc.identifier.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 en_US
dc.identifier.isbn 0780354915
dc.identifier.uri http://hdl.handle.net/10057/3804
dc.identifier.uri http://dx.doi.org/10.1109/MWSCAS.1999.867771
dc.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 en_US
dc.description.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 en_US
dc.language.iso en_US en_US
dc.publisher IEEE en_US
dc.relation.ispartofseries Circuits and Systems, 1999. 42nd Midwest Symposium on;vol.2, no., pp.862-865
dc.subject Cache memory en_US
dc.subject Floods en_US
dc.subject Hard disks en_US
dc.subject Microprocessors en_US
dc.subject Power generation economics en_US
dc.subject Yarn en_US
dc.title Pre-fetching with the segmented LRU algorithm en_US
dc.type Conference paper en_US
dc.description.version Peer reviewed article
dc.rights.holder © IEEE, 1999

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search SOAR

Advanced Search


My Account