Improved Algorithms for Online Load Balancing

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルSOFSEM 2021
ホスト出版物のサブタイトルTheory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Proceedings
編集者Tomáš Bureš, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. Wong
出版社Springer Science and Business Media Deutschland GmbH
ページ203-217
ページ数15
ISBN(印刷版)9783030677305
DOI
出版ステータス出版済み - 2021
イベント47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021 - Bolzano-Bozen, イタリア
継続期間: 1 25 20211 29 2021

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12607 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021
Countryイタリア
CityBolzano-Bozen
Period1/25/211/29/21

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Improved Algorithms for Online Load Balancing」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル