Improved Algorithms for Online Load Balancing

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider an online load balancing problem and its extensions in the framework of repeated games. On each round, the player chooses a distribution (task allocation) over K servers, and then the environment reveals the load of each server, which determines the computation time of each server for processing the task assigned. After all rounds, the cost of the player is measured by some norm of the cumulative computation-time vector. The cost is the makespan if the norm is L -norm. The goal is to minimize the regret, i.e., minimizing the player’s cost relative to the cost of the best fixed distribution in hindsight. We propose algorithms for general norms and prove their regret bounds. In particular, for L -norm, our regret bound matches the best known bound and the proposed algorithm runs in polynomial time per trial involving linear programming and second order programming, whereas no polynomial time algorithm was previously known to achieve the bound.

Original languageEnglish
Title of host publicationSOFSEM 2021
Subtitle of host publicationTheory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings
EditorsTomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. Wong
PublisherSpringer Science and Business Media Deutschland GmbH
Pages203-217
Number of pages15
ISBN (Print)9783030677305
DOIs
Publication statusPublished - 2021
Event47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021 - Bolzano-Bozen, Italy
Duration: Jan 25 2021Jan 29 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12607 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021
CountryItaly
CityBolzano-Bozen
Period1/25/211/29/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Improved Algorithms for Online Load Balancing'. Together they form a unique fingerprint.

Cite this