Advertisement

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

  • Tomáš Ebenlendr
  • Wojciech Jawor
  • Jiří Sgall
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Virtual Machine Competitive Ratio Online Algorithm Identical Machine Online Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. J. Algorithms 35, 108–121 (2000)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chen, B., van Vliet, A., Woeginger, G.J.: Lower bounds for randomized online scheduling. Inform. Process. Lett. 51, 219–222 (1994)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18, 127–131 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 6.
    Epstein, L.: Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios. Oper. Res. Lett. 29, 93–98 (2001)MATHCrossRefMathSciNetGoogle Scholar
  7. 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)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Epstein, L., Sgall, J.: A lower bound for on-line scheduling on uniformly related machines. Oper. Res. Lett. 26(1), 17–22 (2000)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3, 343–353 (2000)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Gonzales, T.F., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92–101 (1978)CrossRefGoogle Scholar
  11. 11.
    Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical J. 45, 1563–1581 (1966)Google Scholar
  12. 12.
    Horwath, E., Lam, E.C., Sethi, R.: A level algorithm for preemptive scheduling. J. ACM 24, 32–43 (1977)CrossRefGoogle Scholar
  13. 13.
    Rudin III, J.F.: Improved Bound for the Online Scheduling Problem. PhD thesis, The University of Texas at Dallas (2001)Google Scholar
  14. 14.
    Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inform. Process. Lett. 63, 51–55 (1997)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Tichý, T.: Randomized on-line scheduling on 3 processors. Oper. Res. Lett. 32, 152–158 (2004)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Wen, J., Du, D.: Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett. 23, 113–116 (1998)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tomáš Ebenlendr
    • 1
  • Wojciech Jawor
    • 2
  • Jiří Sgall
    • 1
  1. 1.Mathematical InstitutePraha 1Czech Republic
  2. 2.Department of Computer ScienceUniversity of CaliforniaRiversideUSA

Personalised recommendations