text

Dynamical adjustment of block replacement algorithms

SOAR Repository

Show simple item record

dc.contributor.author Walterscheidt, U.
dc.contributor.author Pendse, Ravi
dc.date.accessioned 2011-09-20T16:48:42Z
dc.date.available 2011-09-20T16:48:42Z
dc.date.issued 1998-03-08
dc.identifier.citation Walterscheidt, 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.660133 en_US
dc.identifier.isbn 0780345479
dc.identifier.issn 0094-2898
dc.identifier.uri http://hdl.handle.net/10057/3806
dc.identifier.uri http://dx.doi.org/10.1109/SSST.1998.660133
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 Block 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.iso en_US en_US
dc.publisher IEEE en_US
dc.relation.ispartofseries System Theory, 1998. Proceedings of the Thirtieth Southeastern Symposium on;vol., no., pp.544-548
dc.subject Cache storage en_US
dc.subject Condition monitoring en_US
dc.subject Degradation en_US
dc.subject Hard disks en_US
dc.subject Magnetic disc storage en_US
dc.subject Random access memory en_US
dc.subject Runtime en_US
dc.subject Solid state circuits en_US
dc.subject Storage management en_US
dc.subject Throughput en_US
dc.title Dynamical adjustment of block replacement algorithms 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

Browse

My Account

Statistics