On-line load balancing of temporary tasks on identical machines

Yossi Azar, Leah Epstein

Research output: Contribution to conferencePaperpeer-review

Abstract

We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O(log log m/log m) for general m.

Original languageEnglish
Pages119-125
Number of pages7
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS - Ramat-Gan, Isr
Duration: 17 Jun 199719 Jun 1997

Conference

ConferenceProceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS
CityRamat-Gan, Isr
Period17/06/9719/06/97

ASJC Scopus subject areas

  • Computer Science (all)

Fingerprint

Dive into the research topics of 'On-line load balancing of temporary tasks on identical machines'. Together they form a unique fingerprint.

Cite this