Abstract.
In this paper we study three popular on-line disk scheduling algorithms, FCFS, SSTF, and LOOK, using competitive analysis. Our results show that, in a competitive sense, the performance of LOOK is better than those of SSTF and FCFS. As a by-product, our analysis also reveals quantitatively the role played by the size of the window, which in our model is a waiting buffer that holds a fixed number of requests waiting to be serviced next. The window, in some sense, offers the lookahead ability which is mentioned in several on-line problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 1997, and in revised form November 1997, and in final form February 1998.
Rights and permissions
About this article
Cite this article
Tzuoo-Hawn Yeh, ., Cheng-Ming Kuo, ., Chin-Laung Lei, . et al. Competitive Analysis of On-Line Disk Scheduling . Theory Comput. Systems 31, 491–506 (1998). https://doi.org/10.1007/s002240000100
Issue Date:
DOI: https://doi.org/10.1007/s002240000100