Load Balancing: The Long Road from Theory to Practice

07/28/2021
by   Sebastian Berndt, et al.
0

There is a long history of approximation schemes for the problem of scheduling jobs on identical machines to minimize the makespan. Such a scheme grants a (1+ϵ)-approximation solution for every ϵ > 0, but the running time grows exponentially in 1/ϵ. For a long time, these schemes seemed like a purely theoretical concept. Even solving instances for moderate values of ϵ seemed completely illusional. In an effort to bridge theory and practice, we refine recent ILP techniques to develop the fastest known approximation scheme for this problem. An implementation of this algorithm reaches values of ϵ lower than 2/11≈ 18.2% within a reasonable timespan. This is the approximation guarantee of MULTIFIT, which, to the best of our knowledge, has the best proven guarantee of any non-scheme algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2020

Additive Approximation Schemes for Load Balancing Problems

In this paper we introduce the concept of additive approximation schemes...
research
07/13/2021

Tight running times for minimum ℓ_q-norm load balancing: beyond exponential dependencies on 1/ε

We consider a classical scheduling problem on m identical machines. For ...
research
06/23/2020

An Efficient PTAS for Stochastic Load Balancing with Poisson Jobs

We give the first polynomial-time approximation scheme (PTAS) for the st...
research
07/24/2020

Improved approximation schemes for early work scheduling on identical parallel machines with common due date

We study the early work scheduling problem on identical parallel machine...
research
10/02/2018

Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times

We investigate the scheduling of n jobs divided into c classes/batches o...
research
03/02/2023

Improved Algorithms for Monotone Moldable Job Scheduling using Compression and Convolution

In the moldable job scheduling problem one has to assign a set of n jobs...
research
05/11/2021

Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes

Rips complexes are important structures for analyzing topological featur...

Please sign up or login with your details

Forgot password? Click here to reset