Performance of LRU block replacement algorithm with pre-fetching

SOAR Repository

Show simple item record

dc.contributor.author Pendse, Ravi
dc.contributor.author Bhagavathula, Ravi
dc.date.accessioned 2011-09-20T16:57:52Z
dc.date.available 2011-09-20T16:57:52Z
dc.date.issued 1998-08-09
dc.identifier.citation Pendse, R.; Bhagavathula, R.; "Performance of LRU block replacement algorithm with pre-fetching," Circuits and Systems, 1998. Proceedings, 1998 Midwest Symposium on, vol., no., pp.86-89, 9-12 Aug 1998 doi: 10.1109/MWSCAS.1998.759441 en_US
dc.identifier.isbn 0818689145
dc.identifier.uri http://hdl.handle.net/10057/3807
dc.identifier.uri http://dx.doi.org/10.1109/MWSCAS.1998.759441
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 to achieve a better performing cache. A direct fallout of this approach is the increased overhead involved due to the complexity of the algorithm without any significant improvement in the cache performance. The performance of the cache could be improved if spatial locality present in the programs is further exploited. This paper presents the results of the investigation of the impact of pre-fetching techniques on the miss rates due to the basic Least Recently Used (LRU) block replacement algorithm. Simulations reveal an improvement of about 60% in the miss rates for instruction caches due to pre-fetching and a corresponding improvement of about 10% for data caches. en_US
dc.language.iso en_US en_US
dc.publisher IEEE en_US
dc.relation.ispartofseries Circuits and Systems, 1998. Proceedings, 1998 Midwest Symposium on;vol., no., pp.86-89, 9-12 Aug 1998
dc.subject Cache storage en_US
dc.subject Hard disks en_US
dc.subject Microprocessors en_US
dc.subject Memory architecture en_US
dc.subject Power generation economics en_US
dc.subject Random access memory en_US
dc.subject Semiconductor storage en_US
dc.subject Yarn en_US
dc.title Performance of LRU block replacement algorithm with pre-fetching en_US
dc.type Conference paper en_US
dc.description.version Peer reviewed article
dc.rights.holder © IEEE, 1998

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search SOAR

Advanced Search


My Account