Online Load Balancing on Uniform Machines with Limited Migration

09/01/2022
by   Marten Maack, et al.
0

In the problem of online load balancing on uniformly related machines with bounded migration, jobs arrive online one after another and have to be immediately placed on one of a given set of machines without knowledge about jobs that may arrive later on. Each job has a size and each machine has a speed, and the load due to a job assigned to a machine is obtained by dividing the first value by the second. The goal is to minimize the maximum overall load any machine receives. However, unlike in the pure online case, each time a new job arrives it contributes a migration potential equal to the product of its size and a certain migration factor. This potential can be spend to reassign jobs either right away (non-amortized case) or at any later time (amortized case). Semi-online models of this flavor have been studied intensively for several fundamental problems, e.g., load balancing on identical machines and bin packing, but uniformly related machines have not been considered up to now. In the present paper, the classical doubling strategy on uniformly related machines is combined with migration to achieve an (8/3+ε)-competitive algorithm and a (4+ε)-competitive algorithm with O(1/ε) amortized and non-amortized migration, respectively, while the best known competitive ratio in the pure online setting is roughly 5.828.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2022

Bin stretching with migration on two hierarchical machines

In this paper, we consider semi-online scheduling with migration on two ...
research
09/10/2019

Well-behaved Online Load Balancing Against Strategic Jobs

In the online load balancing problem on related machines, we have a set ...
research
11/29/2022

Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse

We consider the online unrelated-machine load balancing problem with rec...
research
01/13/2022

Cardinality Constrained Scheduling in Online Models

Makespan minimization on parallel identical machines is a classical and ...
research
02/02/2021

New Recruiter and Jobs: The Largest Enterprise Data Migration at LinkedIn

In August 2019, we introduced to our members and customers the idea of m...
research
04/13/2019

Online Bin Covering with Limited Migration

Semi-online models where decisions may be revoked in a limited way have ...
research
10/19/2021

Prepartition: Load Balancing Approach for Virtual Machine Reservations in a Cloud Data Center

Load balancing is vital for the efficient and long-term operation of clo...

Please sign up or login with your details

Forgot password? Click here to reset