Maximal workload, minimal workload, maximal workload difference: optimizing all criteria at once

05/18/2023
by   Sébastien Dechamps, et al.
0

In a simple model of assigning workers to tasks, every solution that minimizes the load difference between the most loaded worker and the least loaded one actually minimizes the maximal load and maximizes the minimal load. This can be seen as a consequence of standard results of optimization over polymatroids. We show that similar phenomena still occur in close models, simple to state, and that do not enjoy any polymatroid structure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2019

On the Benefits of Anticipating Load Imbalance for Performance Optimization of Parallel Applications

In parallel iterative applications, computational efficiency is essentia...
research
11/30/2018

Dynamic Load Balancing Techniques for Particulate Flow Simulations

Parallel multiphysics simulations often suffer from load imbalances orig...
research
04/04/2021

Optimal Load Balancing and Assessment of Existing Load Balancing Criteria

Parallel iterative applications often suffer from load imbalance, one of...
research
08/16/2018

Simple Load Balancing

We consider the following load balancing process for m tokens distribute...
research
04/16/2019

Parallel Balanced Allocations: The Heavily Loaded Case

We study parallel algorithms for the classical balls-into-bins problem, ...
research
09/13/2021

Reinforcement Learning for Load-balanced Parallel Particle Tracing

We explore an online learning reinforcement learning (RL) paradigm for o...
research
08/08/2022

Almost optimal searching of maximal subrepetitions in a word

For 0<δ <1 a δ-subrepetition in a word is a factor which exponent is les...

Please sign up or login with your details

Forgot password? Click here to reset