Sciweavers

JCO
2008

The hierarchical model for load balancing on two machines

13 years 3 months ago
The hierarchical model for load balancing on two machines
Following previous work, we consider the hierarchical load balancing model on two machines of possibly different speeds. We first focus on maximizing the minimum machine load and show that no competitive algorithm exists for this problem. We overcome this barrier in two ways, both related to previously known models. The first one is fractional assignment, where each job can be arbitrarily split between the machines. The second one is a semi-online model where the sum of jobs is known in advance. We design algorithms of best possible competitive ratios for both these cases. Furthermore, we show that the combination of the two models leads to the existence of an optimal algorithm (i.e., an algorithm of competitive ratio 1). This algorithm is clearly optimal for the makespan minimization problem as well. For the latter problem, we consider the fractional assignment model and design an algorithm of best possible competitive ratio for it.
Orion Chassid, Leah Epstein
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2008
Where JCO
Authors Orion Chassid, Leah Epstein
Comments (0)