DocumentCode
1034517
Title
Caching strategies to improve disk system performance
Author
Karedla, Ramakrishna ; Love, J. Spencer ; Wherry, Bradley G.
Author_Institution
Digital Equipment Corp., Shrewsbury, MA, USA
Volume
27
Issue
3
fYear
1994
fDate
3/1/1994 12:00:00 AM
Firstpage
38
Lastpage
46
Abstract
I/O subsystem manufacturers attempt to reduce latency by increasing disk rotation speeds, incorporating more intelligent disk scheduling algorithms, increasing I/O bus speed, using solid-state disks, and implementing caches at various places in the I/O stream. In this article, we examine the use of caching as a means to increase system response time and improve the data throughput of the disk subsystem. Caching can help to alleviate I/O subsystem bottlenecks caused by mechanical latencies. This article describes a caching strategy that offers the performance of caches twice its size. After explaining some basic caching issues, we examine some popular caching strategies and cache replacement algorithms, as well as the advantages and disadvantages of caching at different levels of the computer system hierarchy. Finally, we investigate the performance of three cache replacement algorithms: random replacement (RR), least recently used (LRU), and a frequency-based variation of LRU known as segmented LRU (SLRU).<>
Keywords
buffer storage; magnetic disc storage; performance evaluation; I/O bus speed; I/O subsystem; cache replacement algorithms; caching strategies; computer system hierarchy; data throughput; disk rotation speeds; disk system performance; frequency-based variation; intelligent disk scheduling algorithms; latency; least recently used algorithm; random replacement; segmented LRU; solid-state disks; system response time; Algorithm design and analysis; Control systems; Costs; Delay; Drives; Hardware; Operating systems; System performance; Terminology; Throughput;
fLanguage
English
Journal_Title
Computer
Publisher
ieee
ISSN
0018-9162
Type
jour
DOI
10.1109/2.268884
Filename
268884
Link To Document