A lower bound for randomized on-line multiprocessor scheduling

https://doi.org/10.1016/S0020-0190(97)00093-8Get rights and content

Abstract

We significantly improve the previous lower bounds on the performance of randomized algorithms for on-line scheduling jobs on m identical machines. We also show that a natural idea for constructing an algorithm with matching performance does not work.

References (10)

There are more references available in the full text version of this article.

Cited by (64)

  • Semi-online scheduling revisited

    2012, Theoretical Computer Science
  • Randomized priority algorithms

    2010, Theoretical Computer Science
View all citing articles on Scopus
1

Partially supported by grants A119107 and A1019602 of AVČR; part of this work was done at Carnegie-Mellon University, Pittsburgh, PA, USA.

View full text