Show simple item record

dc.contributor.authorPendse, Ravi
dc.contributor.authorBhagavathula, Ravi
dc.date.accessioned2011-09-20T16:57:52Z
dc.date.available2011-09-20T16:57:52Z
dc.date.issued1998-08-09
dc.identifier.citationPendse, 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.759441en_US
dc.identifier.isbn0818689145
dc.identifier.urihttp://hdl.handle.net/10057/3807
dc.identifier.urihttp://dx.doi.org/10.1109/MWSCAS.1998.759441
dc.descriptionThe 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=1045954en_US
dc.description.abstractAn 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.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesCircuits and Systems, 1998. Proceedings, 1998 Midwest Symposium on;vol., no., pp.86-89, 9-12 Aug 1998
dc.subjectCache storageen_US
dc.subjectHard disksen_US
dc.subjectMicroprocessorsen_US
dc.subjectMemory architectureen_US
dc.subjectPower generation economicsen_US
dc.subjectRandom access memoryen_US
dc.subjectSemiconductor storageen_US
dc.subjectYarnen_US
dc.titlePerformance of LRU block replacement algorithm with pre-fetchingen_US
dc.typeConference paperen_US
dc.description.versionPeer reviewed article
dc.rights.holder© IEEE, 1998


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record