Summary: On­Line Load Balancing of Temporary Tasks on Identical Machines
Yossi Azar \Lambda
Tel­Aviv Univ.
Leah Epstein y
Tel­Aviv Univ.
Abstract
We prove an exact lower bound of 2 \Gamma 1
m on the compet­
itive ratio of any deterministic algorithm for load balancing
of temporary tasks on m identical machines. We also show
a lower bound of 2 \Gamma 1
m for randomized algorithms for
small m and 2 \Gamma 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 \Gamma O( loglog m
logm )
for general m.
1. Introduction
We consider the problem of non­preemptive on­line load

Source: Azar, Yossi - School of Computer Science, Tel Aviv University
Epstein, Leah - Department of Mathematics, University of Haifa

Collections: Computer Technologies and Information Sciences; Mathematics