ComputingComputer ScienceComputer SystemsAlgorithmsOptimizationSchedulingCpu SchedulingLatency OptimizationMachine SchedulingResource SchedulingTask SchedulingDisk I/o AnalysisDisk SchedulingRead Latency OptimizationRequest SchedulingScheduling AlgorithmsSeek OptimizationStorage Resource SchedulingWrite Latency Optimization
The author describes a number of configurations and disk scheduling algorithms for shadow sets, and presents an analysis of seek time based on both a simulation and an analytic model. She focuses on the algorithm based on assigning a read request to the arm that is within the shortest seek distance of the target location. With this scheduling algorithm, shadowing five disks decreases the expected seek time for reads by 50%. For a ratio of reads to writes equal to 1.5 or higher, shadowing decreases the overall seek time by 20%.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
7
Dina Bitton, Jim Gray · Very Large Data Bases · 1988 · 227 citations
A comparative analysis of disk scheduling policies
Toby J. Teorey, Tad B. Pinkerton · Communications of the ACM · 1972 · 218 citations · Full text
Micha Hofri · Communications of the ACM · 1980 · 111 citations · Full text
Arm scheduling in shadowed disks
Dina Bitton · 2003 · 86 citations