Improving disk cache hit-ratios through cache partitioning

Author

Thiébaut, Dominique ; Stone, Harold S. ; Wolf, Joel L.

Author_Institution

Dept. of Comput. Sci., Smith Coll., Northampton, MA, USA

Volume

41

Issue

6

fYear

1992

fDate

6/1/1992 12:00:00 AM

Firstpage

665

Lastpage

676

Abstract

An adaptive algorithm for managing fully associative cache memories shared by several identifiable processes is presented. The on-line algorithm extends an earlier model due to H.S. Stone et al. (1989) 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-MB 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 queuing 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

Keywords

buffer storage; content-addressable storage; magnetic disc storage; adaptive algorithm; cache partitioning; cache storage; disk cache; fully associative cache memories; hit-ratios; queuing network model; Adaptive algorithm; Aging; Cache memory; Cache storage; Degradation; Delay; Partitioning algorithms; Prefetching; Queueing analysis; Throughput;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.144619

Filename

144619