| | |
Summary: Path-Independent Load Balancing With Unreliable Machines
James Aspnes
Yang Richard Yang
Yitong Yin§
Abstract
We consider algorithms for load balancing on unreliable ma-
chines. The objective is to optimize the two criteria of min-
imizing the makespan and minimizing job reassignments in
response to machine failures. We assume that the set of
jobs is known in advance but that the pattern of machine
failures is unpredictable. Motivated by the requirements of
BGP routing, we consider path-independent algorithms,
with the property that the job assignment is completely de-
termined by the subset of available machines and not the
previous history of the assignments. We examine first the
question of performance measurement of path-independent
load-balancing algorithms, giving the measure of makespan
and the normalized measure of reassignments cost. We then
describe two classes of algorithms for optimizing these mea-
sures against an oblivious adversary for identical machines.
|
