Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN StepSCAN
 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.
 Title
 Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andNStepSCAN
 Journal

BIT Numerical Mathematics
Volume 32, Issue 4 , pp 546558
 Cover Date
 199212
 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