Summary: On­line Load Balancing of Temporary Tasks \Lambda
Yossi Azar y
Tel­Aviv Univ.
Bala Kalyanasundaram z
Univ. of Pittsburgh
Serge Plotkin x
Stanford Univ.
Kirk R. Pruhs --
Univ. of Pittsburgh
Orli Waarts k
U.C. Berkeley
Abstract
This paper considers the non­preemptive on­line load balancing problem where tasks
have limited duration in time. Upon arrival, each task has to be immediately assigned
to one of the machines, increasing the load on this machine for the duration of the task
by an amount that depends on both the machine and the task. The goal is to minimize
the maximum load.
Azar, Broder and Karlin studied the unknown duration case where the duration of
a task is not known upon its arrival [4]. They focused on the special case in which for
each task there is a subset of machines capable of executing it, and the increase in load

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences