About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE TC
Paper
Improving Disk Cache Hit-Ratios Through Cache Partitioning
Abstract
This paper presents an adaptive algorithm for managing fully associative cache memories shared by several identifiable processes. The on-line algorithm extends an earlier model due to Stone, Wolf, and Turek, and partitions the cache storage in disjoint blocks whose sizes are determined by the locality of the processes accessing the cache. Simulation results of traces for 32-megabyte disk caches show a relative improvement in the overall and read hit-ratios in the range of 1% to 2% over those generated by a conventional Least Recently Used replacement algorithm. The analysis of a queueing network model shows that such an increase in hit-ratio in a system with a heavy throughput of I/O requests can provide a significant decrease in disk response time. © 1992 IEEE