Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 2006: Algorithms – ESA 2006 pp 327–339Cite as

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4168))

Abstract

Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e ≈2.718.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S.: On randomized online scheduling. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 134–143. ACM Press, New York (2002)

    Google Scholar 

  2. Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35, 108–121 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Inform. Process. Lett. 51, 219–222 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18, 127–131 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ebenlendr, T., Sgall, J.: Optimal and online preemptive scheduling on uniformly related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 199–210. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Epstein, L.: Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29, 93–98 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized on-line scheduling for two related machines. J. Sched. 4, 71–92 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1), 17–22 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3, 343–353 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92–101 (1978)

    Article  Google Scholar 

  11. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical J. 45, 1563–1581 (1966)

    Google Scholar 

  12. Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. J. ACM 24, 32–43 (1977)

    Article  Google Scholar 

  13. Rudin III, J.F.: Improved Bound for the Online Scheduling Problem. PhD thesis, The University of Texas at Dallas (2001)

    Google Scholar 

  14. Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inform. Process. Lett. 63, 51–55 (1997)

    Article  MathSciNet  Google Scholar 

  15. Tichý, T.: Randomized on-line scheduling on 3 processors. Oper. Res. Lett. 32, 152–158 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett. 23, 113–116 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, CZ-11567, Praha 1, Czech Republic

    Tomáš Ebenlendr & Jiří Sgall

  2. Department of Computer Science, University of California, Riverside, CA, 92521, USA

    Wojciech Jawor

Authors
  1. Tomáš Ebenlendr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Jawor
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA and School of Computer Science, Tel-Aviv University, 69978, Tel-Aviv, Israel

    Yossi Azar

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Thomas Erlebach

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ebenlendr, T., Jawor, W., Sgall, J. (2006). Preemptive Online Scheduling: Optimal Algorithms for All Speeds. In: Azar, Y., Erlebach, T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841036_31

Download citation

  • DOI: https://doi.org/10.1007/11841036_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38875-3

  • Online ISBN: 978-3-540-38876-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation