Paper Info
Title
Disk scheduling: FCFS vs.SSTF revisited
Abstract
We report on a rather extensive simulation effort directed at evaluating the merits of two scheduling strategies, FCFS and SSTF, for moving-arm disks under stationary request arrival process. For First-Come-First-Served (FCFS) scheduling, analytic results for the mean waiting time are also given (in a closed form). If the objective of a schedule is to minimize the mean waiting time (or queue size) and its variance, the results seem to confirm the overall superiority of Shortest-Seek-Time-First (SSTF), particularly for medium and heavy traffic. This holds also when the input is highly correlated or addresses the cylinders nonuniformly. These results contradict some statements published in recent years. The domain of policies where SSTF is optimal is considered. The simulation methodology is described in some detail.
Year
DOI
Venue
1980
10.1145/359024.359034
Commun. ACM
Keywords
Field
DocType
queue size,sstf,moving-arm disk,fcfs,scheduling strategy,overall superiority,simulation methodology,analytic result,disk scheduling,simulation,closed form,scheduling,correlated input,cylinders nonuniformly,optimal schedule,extensive simulation effort,heavy traffic,fcfs vs.sstf
Arrival process,I/O scheduling,Scheduling (computing),Computer science,Parallel computing,Queue,Theoretical computer science,Distributed computing
Journal
Volume
Issue
ISSN
23
11
0001-0782
Citations 
PageRank 
References 
56
40.30
7
Authors
1
Name
Order
Citations
PageRank
Micha Hofri1342127.96