Work

Brief Announcement: Load Balancing with Duration Predictions

Year: 2025

Type: conference-paper

Abstract: We study the classic fully dynamic load balancing problem on unrelated machines where jobs arrive and depart over time and the goal is minimizing the maximum load, or more generally the ℓp-norm of the load vector. Previous work either studied the clairvoyant setting in which exact durations are known to the algorithm, or the unknown duration setting in which no information on the duration is given to the algorithm. For the clairvoyant setting algorithms with polylogarithmic competitive ratios were designed, while for the unknown duration setting strong lower bounds exist and only polynomial competitive factors are possible.

Source: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)

DOI: 10.1145/3694906.3743323

Authors: Yossi Azar, Niv Buchbinder, Tomer Epshtein

Institution: Tel Aviv University

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: Israel Science Foundation, Universitas Brawijaya

Award: G77985370