Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andNStepSCAN
 TungShou Chen,
 WeiPang Yang,
 R. C. T. Lee
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
The amortized analysis is a useful tool for analyzing the timecomplexity of performing a sequence of operations. The disk scheduling problem involves a sequence of requests in general. In this paper, the performances of representative disk scheduling algorithms,SSTF, SCAN, andNStepSCAN, are analyzed in the amortized sense. A lower bound of the amortized complexity for the disk scheduling problem is also derived. According to our analysis,SCAN is not only better thanSSTF andNStepSCAN, but also an optimal algorithm. Various authors have studied the disk scheduling problem based on some probability models and concluded that the most acceptable performance is obtained fromSCAN. Our result therefore supports their conclusion.
 J. L. Bentley and C. C. McGeoch,Amortized analyses of selforganizing sequential heuristics, Comm. ACM 28, No. 4 (1985), pp. 404–411. CrossRef
 T. S. Chen, W. P. Yang and R. C. T. Lee,Amortized analyses of disk scheduling algorithms: SSTF and SCAN, Proc. of National Computer Symposium, Taiwan, R.O.C., (1989), pp. 831–836.
 T. S. Chen and W. P. Yang,Amortized analysis for a continuum of disk scheduling V(R), Proc. of International Conference on Information and Systems, AMSE, Hangzhou, China, (1991), pp. 1277–1280.
 E. G. Coffman, L. A. Klimko and B. Ryan,Analysis of scanning policies for reducing disc seek times, SIAM Journal on Computing, 1, (1972), pp. 269–279. CrossRef
 H. M. Deitel,Operating Systems (Second Edition), AddisonWesley Publishing Co. Reading Mass., (1990).
 P. J. Denning,Effects of scheduling on file memory operations, Proc. AFIPS, Montvale, N.J., (1967), pp. 9–21.
 M. L. Fredman, R. Sedgewick, D. D. Sleator and R. E. Tarjan,The pairing heap: a new form of selfadjusting heap, Algorithmica No. 1 (1986), pp. 111–129.
 H. Frank,Analysis and optimization of disk storage devices for time sharing systems, J. ACM 16, No. 4 (1969), pp. 602–620. CrossRef
 R. Geist and S. Daniel,A continuum of disk scheduling algorithms, ACM Trans. Computer Syst. 5, No. 1 (1987), pp. 77–92. CrossRef
 E. F. Grove,The harmonic online kserver algorithm is competitive, In Proc. 23rd ACM Symposium on Theory of Computing, (1991), pp. 260–266.
 M. Hofri,Disk scheduling FCFS vs. SSTF revisited, Comm. ACM 23, No. 11 (1980), pp. 645–653. CrossRef
 R. C. T. Lee, R. C. Chang and S. S. Tseng,Introduction to the Design and Analysis of Algorithms, Prentice Hall, (1989).
 M. Manasse, L. A. McGeoch and D. D. Sleator,Competitive algorithms for online problems, In Proc. 20th Annual ACM Symposium on Theory of Computing, (1988), pp. 322–333.
 M. Manasse, L. A. McGeoch and D. D. Sleator,Competitive algorithms for server problems, Journal of Algorithms, 11 (1990), pp. 208–230. CrossRef
 B. M. E. Moret and H. D. Shapior,Algorithms from P to NP, Volume I: Design and Efficiency, The Benjamin/Cummings Publishing Company, Inc. Redwood City, CA 94065 (1991).
 P. W. Purdom, Jr. and C. A. Brown,The Analysis of Algorithms, CBS College Publishing, (1985).
 A. Silberschatz and J. L. Peterson,Operating System Concepts, AddisonWesley Publishing, Reading Mass., (1988), pp. 263.
 D. D. Sleator and R. E. Tarjan,Selfadjusting binary search trees, J. Assoc. Comput. Mach. 32, No. 3 (1985), pp. 652–686.
 D. D. Sleator and R. E. Tarjan,Selfadjusting heaps, SIAM J. Comput. 15, No. 1 (1986), pp. 52–69. CrossRef
 R. E. Tarjan,Data structure and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia, Pa., (1983).
 R. E. Tarjan,Amortized computational complexity, SIAM J. Alg. Disc. Math. 6, No. 2 (1985), 306–318. CrossRef
 T. J. Teorey and T. B. Pinkerton,A comparative analysis of disk scheduling policies, Comm. ACM 15, No. 3 (1972), pp. 177–194. CrossRef
 N. C. Wilhelm,An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses, Comm. ACM 19, No. 1 (1976), 13–17. CrossRef
 W. P. Yang and T. S. Chen,The study of amortized complexity on disk system, Technical Report, NSC790408E00901, National Chiao Tung University, Hsinchu, Taiwan, R.O.C., (1989).
 Title
 Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andNStepSCAN
 Journal

BIT Numerical Mathematics
Volume 32, Issue 4 , pp 546558
 Cover Date
 19921201
 DOI
 10.1007/BF01994839
 Print ISSN
 00063835
 Online ISSN
 15729125
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 F.2.2
 D.4.2
 amortized analysis
 disk scheduling
 online problem
 Industry Sectors
 Authors

 TungShou Chen ^{(1)} ^{(2)} ^{(3)}
 WeiPang Yang ^{(1)} ^{(2)} ^{(3)}
 R. C. T. Lee ^{(1)} ^{(2)} ^{(3)}
 Author Affiliations

 1. Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, ROC
 2. Department of Computer and Information Science, National Chiao Tung University, Hsinchu, Taiwan, ROC
 3. Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, ROC