Disk scheduling in System V
- 1 May 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 15 (1) , 59-68
- https://doi.org/10.1145/29904.29913
Abstract
A variety of disk scheduling algorithms, including some newly defined ones, are compared both in simulation and in tests on a real machine running UNIX * System V. In the real system tests, first-come first-served (FCFS), shortest seek time first (SSTF), and the standard System V algorithm (SVS) are all seen to yield relatively poor mean waiting time performance when compared to the VSCAN(0.2) algorithm and modifications thereof suggested by Coffman. Nevertheless, each is seen to excel along a particular performance dimension. The adequacy of open, Poisson arrival simulation models in predicting disk scheduling performance is questioned, and an alternative arrival model is suggested which offers improved predictions in the System V environment.Keywords
This publication has 5 references indexed in Scilit:
- A continuum of disk scheduling algorithmsACM Transactions on Computer Systems, 1987
- On the Expected Performance of Scanning DisksSIAM Journal on Computing, 1982
- Disk schedulingCommunications of the ACM, 1980
- An anomaly in disk schedulingCommunications of the ACM, 1976
- A comparative analysis of disk scheduling policiesCommunications of the ACM, 1972