Thumbnail
Access Restriction
Subscribed

Author Hofri, Micha
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Simulation ♦ Sstf ♦ Scheduling ♦ Fcfs ♦ Moving-arm disk ♦ Correlated input ♦ Optimal schedule
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.
Description Affiliation: Technion—Israel Institute of Technology, Haifa, Israel (Hofri, Micha)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 23
Issue Number 11
Page Count 9
Starting Page 645
Ending Page 653


Open content in new tab

   Open content in new tab
Source: ACM Digital Library