Show simple item record

dc.contributor.authorWalterscheidt, U.
dc.contributor.authorPendse, Ravi
dc.date.accessioned2011-09-20T16:48:42Z
dc.date.available2011-09-20T16:48:42Z
dc.date.issued1998-03-08
dc.identifier.citationWalterscheidt, U.; Pendse, R.; , "Dynamical adjustment of block replacement algorithms," System Theory, 1998. Proceedings of the Thirtieth Southeastern Symposium on , vol., no., pp.544-548, 8-10 Mar 1998 doi: 10.1109/SSST.1998.660133en_US
dc.identifier.isbn0780345479
dc.identifier.issn0094-2898
dc.identifier.urihttp://hdl.handle.net/10057/3806
dc.identifier.urihttp://dx.doi.org/10.1109/SSST.1998.660133
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.abstractBlock replacement algorithms are an important component of any cache controller, specially for disk caches. In recent years, complex and sophisticated algorithms have been developed, that reduce the miss-rate of disk caches. All of these algorithms require some sort of tuning in order to achieve their full performance. Up until now, the “optimal” parameters have been determined by running simulations with access traces. Parameters found have then been implemented in the hope that the actual access patterns would not deviate too much from the ones used in the simulations. When they did, miss-rates would increase, often exceeding miss-rates of more conventional replacement strategies like the least recently used block replacement algorithm (LRU). In this paper, we present a method of adjusting an algorithm's tuning parameter at run-time, by constantly monitoring its performance. We will show that dynamic tuning is able to approach the results of an optimal value that was determined by using simulations. Additionally, we will demonstrate the ability of this new technique to adapt to completely different workloads.en_US
dc.language.isoen_USen_US
dc.publisherIEEEen_US
dc.relation.ispartofseriesSystem Theory, 1998. Proceedings of the Thirtieth Southeastern Symposium on;vol., no., pp.544-548
dc.subjectCache storageen_US
dc.subjectCondition monitoringen_US
dc.subjectDegradationen_US
dc.subjectHard disksen_US
dc.subjectMagnetic disc storageen_US
dc.subjectRandom access memoryen_US
dc.subjectRuntimeen_US
dc.subjectSolid state circuitsen_US
dc.subjectStorage managementen_US
dc.subjectThroughputen_US
dc.titleDynamical adjustment of block replacement algorithmsen_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