Skip to main content
SpringerLink
Log in

Competitive analysis of the Round Robin algorithm

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1992)

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

Included in the following conference series:

Abstract

We investigate on-line algorithms that schedule preemptive tasks on single processor machines when the arrival time of a task is not known in advance and the length of a task is unknown until its termination. The goal is to minimize the sum of the waiting times over all tasks. We formulate an on-line algorithm, RR, which is an ideal version of so-called Round Robin algorithm. It is known that, if all tasks arrive at one time, RR is 2-competitive [W]. We prove that, when tasks may arrive at different times, the competitve ratio of RR is between 2(k−1)/H k −1 and 2(k−1), where k is the maximal number of tasks that can exist at any given time. Our analysis also yields bounds on the sum of response times, and through several criteria we demonstrate the effectiveness of Round Robin algorithm.

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. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier and D. Shasha. On-line scheduling in the presence of overload. Proc. 32nd IEEE FOCS, pages 100–110, 1991.

    Google Scholar 

  2. A. Borodin, N. Linial and M. Saks. An optimal online algorithm for metrical task systems. Proc. 19th ACM STOC, pages 373–382, May 1987.

    Google Scholar 

  3. A. Feldmann, J. Sgall and S. H. Teng. Dynamic scheduling on parallel machines. Proc. 32nd IEEE FOCS, pages 111–120, 1991.

    Google Scholar 

  4. S. Hasegawa. Oral communication, 1992.

    Google Scholar 

  5. M. Manasse, L. A. McGeoch and D. Sleator. Competitive algorithms for on-line problems. Proc. 20th ACM STOC, pages 322–333, May 1988, Chicago.

    Google Scholar 

  6. R.Motwani, S.Phillips and E.Torng. Non-Clearvoyant Scheduling. Manuscript, 1992.

    Google Scholar 

  7. P. Raghavan and M. Snir. Memory versus ramdomization in online algorithms. Proc. 16th ICALP, Italy, July 1989.

    Google Scholar 

  8. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, February 1985.

    Article  Google Scholar 

  9. D. B. Shmoys, J. Wein and D. P. Williamson. Scheduling parallel machines on-line. Proc. 32nd IEEE FOCS, pages 131–140, 1991.

    Google Scholar 

  10. J. Wein. Private communication, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, University of Tokyo, 113, Tokyo, Japan

    Tsuyoshi Matsumoto

Authors
  1. Tsuyoshi Matsumoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Toshihide Ibaraki Yasuyoshi Inagaki Kazuo Iwama Takao Nishizeki Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

Âİ 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matsumoto, T. (1992). Competitive analysis of the Round Robin algorithm. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-56279-6_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56279-5

  • Online ISBN: 978-3-540-47501-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation