Online Load Balancing on Uniform Machines with Limited Migration
Marten Maack

TL;DR
This paper introduces new online algorithms for load balancing on uniformly related machines with limited migration, achieving better competitive ratios than traditional methods by combining doubling strategies with migration techniques.
Contribution
It presents the first algorithms for uniform machines with migration, improving competitive ratios from about 5.828 to 8/3+ε and 4+ε with controlled migration.
Findings
Achieved an (8/3+ε)-competitive algorithm with O(1/ε) migration
Developed a (4+ε)-competitive algorithm with O(1/ε) migration
Improved upon the best known online competitive ratio for this problem
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization
