Skip to main content
SpringerLink
Log in

Competitive analysis of on-line disk scheduling

  • Session 9a: Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1178))

Included in the following conference series:

Abstract

We give a detailed competitive analysis of a popular on-line disk scheduling algorithm, namely, LOOK. Our analysis yields a tight competitive ratio for the LOOK algorithm. By comparing and contrasting the competitive ratio of LOOK with the lower bounds of FCFS and SSTF (which are equally popular in disk scheduling), our results provide strong evidence to suggest that when the workload of disk access is heavy, LOOK outperforms SSTF and FCFS. As a by-product, our analysis also reveals (quantitatively) the role played by the degree of look-ahead in disk scheduling.

This work was supported in part by the National Science Council of the Republic of China under Grant NSC-84-2213-E-002-002.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Chen, W. Yang, and R. Lee. Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, and n-step SCAN. BIT, 32:546–558, 1992.

    Article  MathSciNet  Google Scholar 

  2. M. Chrobak and L. Larmore. An optimal on-line algorithm for k-servers on trees. SIAM Journal on Computing, 20:144–148, 1991.

    Article  Google Scholar 

  3. E. Coffman, Jr. and M. Hofri. On the expected performance of scanning disks. SIAM Journal on Computing, 11(1):60–70, February 1982.

    Article  Google Scholar 

  4. A. Fiat, D. Foster, H. Karloff, Y. Rabani, Y. Ravid, and N. E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685–699, 1991.

    Article  Google Scholar 

  5. A. Fiat, Y. Rabani, and Y. Ravid. Competitive k-server algorithms. J. Computer and System Sciences, 48:410–428, 1994.

    Article  Google Scholar 

  6. R. Geist and S. Daniel. A continuum of disk scheduling algorithms. ACM Transactions on Computer Systems, 5(1):77–92, February 1987.

    Article  Google Scholar 

  7. M. Hofri. Disk scheduling: FCFS vs. SSTF revisited. Comm. of the ACM, 23(11):645–653, November 1980.

    Article  Google Scholar 

  8. M. Seltze, P. Chen, and J. Ousterhout. Disk scheduling revisited. In USENIX Technique Conference, 1990.

    Google Scholar 

  9. A. Silberschatz, J. Peterson, and P. Galvin. Operating System Concepts. Addison Wesley, third edition, 1991.

    Google Scholar 

  10. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Comm. of the ACM, 28(2):202–208, February 1985.

    Article  Google Scholar 

  11. T. Teorey and T. Pinkerton. A comparative analysis of disk scheduling policies. Comm. of the ACM, 15(3):177–184, March 1972.

    Article  Google Scholar 

  12. N. Wilhelm. An anomaly in disk scheduling: a comparison of FCFS and SSTF seek scheduling using an empirical model for disk accesses. Comm. of the ACM, 19(1):13–17, January 1976.

    Article  Google Scholar 

  13. T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Technical report, Dept. of Electircal Engineering, National Taiwan University, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan, ROC

    Tzuoo-Hawn Yeh, Cheng-Ming Kuo, Chin-Laung Lei & Hsu-Chun Yen

Authors
  1. Tzuoo-Hawn Yeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cheng-Ming Kuo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chin-Laung Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hsu-Chun Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tetsuo Asano Yoshihide Igarashi Hiroshi Nagamochi Satoru Miyano Subhash Suri

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yeh, TH., Kuo, CM., Lei, CL., Yen, HC. (1996). Competitive analysis of on-line disk scheduling. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009512

Download citation

  • DOI: https://doi.org/10.1007/BFb0009512

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62048-8

  • Online ISBN: 978-3-540-49633-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation