ACM Home Page
Please provide us with feedback. Feedback
Disk scheduling: FCFS vs.SSTF revisited
Full text PdfPdf (944 KB)
Source
Communications of the ACM archive
Volume 23 ,  Issue 11  (November 1980) table of contents
Pages: 645 - 653  
Year of Publication: 1980
ISSN:0001-0782
Author
Micha Hofri  Technion—Israel Institute of Technology, Haifa, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 72,   Citation Count: 20
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359024.359034
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Coffman, E.G., Jr., and Hofri, M. A class of FIFO queues arising in computer systems. Operations Res. 26, 5 (Sept.-Oct. 1978), 864- 880.
3
 
4
Hofri, M. Queueing phenomena at computing storage devices. TR #78, Dept. of ComPtr. Sci., Technion, Israel Inst. of Technology, June 1976.
 
5
Neuts, M.F. Some explicit formulas for the steady-state behavior of a queue with semi-Markovian service times. Adv. AppL Prob. 9, 1 (Jan. 1977), 141-157.
6
 
7
Lippman, S.A. Applying a new device in the optimization of exponential queueing systems. Operations Res. 23, 4 (July-Aug. 1975), 687-710.
 
8
Teorey, T.J. Properties of disk scheduling policies in multiprogrammed computer systems. Proc. AFIPS Fall Joint Comptr. Conf., Vol. 41, Arlington, Va., 1972, pp. 1-11.

CITED BY  20