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.
For this problem, Chassid and Epstein REF considered fractional model where each job can be arbitrarily split between the machines and parts of the same job can run on different machines in parallel, and a semi-online model with known the total job size in advance.
The hierarchical model for load balancing on two machines
Journal of Combinatorial Optimization
Mathematics Computer Science