Randomized algorithms for online vector load balancing

Yossi Azar; Ilan Reuven Cohen; Debmalya Panigrahi

doi:10.1137/1.9781611975031.63

Randomized algorithms for online vector load balancing

Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

We study randomized algorithms for the online vector bin packing and vector scheduling problems. For vector bin packing, we achieve a competitive ratio of ~O(d1=B), where d is the number of dimensions and B the size of a bin. This improves the previous bound of Õ(d¹B)) by a polynomial factor, and is tight up to logarithmic factors. For vector scheduling, we show a lower bound of ( log d log log d ) on the competitive ratio of randomized algorithms, which is the first result for randomized algorithms and is asymptotically tight. Finally, we analyze the widely used "power of two choices' algorithm for vector scheduling, and show that its competitive ratio is O(log log n+ log d log log d ), which is optimal up to the additive O(log log n) term that also appears in the scalar version of this algorithm.

Original language	English
Title of host publication	29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Editors	Artur Czumaj
Publisher	Association for Computing Machinery
Pages	990-991
Number of pages	2
ISBN (Electronic)	9781611975031
DOIs	https://doi.org/10.1137/1.9781611975031.63
State	Published - 2018
Externally published	Yes
Event	29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States Duration: 7 Jan 2018 → 10 Jan 2018

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference	29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Country/Territory	United States
City	New Orleans
Period	7/01/18 → 10/01/18

Bibliographical note

Publisher Copyright:
© Copyright 2018 by SIAM.

Funding

∗email:[email protected]. SupportedinpartbytheIsraelScienceFounda-tion(grantNo. 1506/16)andbytheICRCBlavatnik Fund. †email:[email protected]. SupportedinpartbytheI-COREpro-gram(centerno. 4/11). ‡email:[email protected]. Supported in part by NSF grants CCF-1527084andCCF-1535972.

Funders	Funder number
National Science Foundation	CCF-1527084andCCF-1535972

Access to Document

10.1137/1.9781611975031.63

Cite this

@inproceedings{d9c6f97a64b644bfa309d82166468bc4,

title = "Randomized algorithms for online vector load balancing",

abstract = "We study randomized algorithms for the online vector bin packing and vector scheduling problems. For vector bin packing, we achieve a competitive ratio of ~O(d1=B), where d is the number of dimensions and B the size of a bin. This improves the previous bound of {\~O}(d1B)) by a polynomial factor, and is tight up to logarithmic factors. For vector scheduling, we show a lower bound of ( log d log log d ) on the competitive ratio of randomized algorithms, which is the first result for randomized algorithms and is asymptotically tight. Finally, we analyze the widely used {"}power of two choices' algorithm for vector scheduling, and show that its competitive ratio is O(log log n+ log d log log d ), which is optimal up to the additive O(log log n) term that also appears in the scalar version of this algorithm.",

author = "Yossi Azar and Cohen, {Ilan Reuven} and Debmalya Panigrahi",

year = "2018",

doi = "10.1137/1.9781611975031.63",

language = "אנגלית",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "990--991",

editor = "Artur Czumaj",

booktitle = "29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018",

}

Azar, Y, Cohen, IR & Panigrahi, D 2018, Randomized algorithms for online vector load balancing. in A Czumaj (ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, pp. 990-991, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, United States, 7/01/18. https://doi.org/10.1137/1.9781611975031.63

Randomized algorithms for online vector load balancing. / Azar, Yossi; Cohen, Ilan Reuven; Panigrahi, Debmalya.
29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. ed. / Artur Czumaj. Association for Computing Machinery, 2018. p. 990-991 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Randomized algorithms for online vector load balancing

AU - Azar, Yossi

AU - Cohen, Ilan Reuven

AU - Panigrahi, Debmalya

PY - 2018

Y1 - 2018

N2 - We study randomized algorithms for the online vector bin packing and vector scheduling problems. For vector bin packing, we achieve a competitive ratio of ~O(d1=B), where d is the number of dimensions and B the size of a bin. This improves the previous bound of Õ(d1B)) by a polynomial factor, and is tight up to logarithmic factors. For vector scheduling, we show a lower bound of ( log d log log d ) on the competitive ratio of randomized algorithms, which is the first result for randomized algorithms and is asymptotically tight. Finally, we analyze the widely used "power of two choices' algorithm for vector scheduling, and show that its competitive ratio is O(log log n+ log d log log d ), which is optimal up to the additive O(log log n) term that also appears in the scalar version of this algorithm.

AB - We study randomized algorithms for the online vector bin packing and vector scheduling problems. For vector bin packing, we achieve a competitive ratio of ~O(d1=B), where d is the number of dimensions and B the size of a bin. This improves the previous bound of Õ(d1B)) by a polynomial factor, and is tight up to logarithmic factors. For vector scheduling, we show a lower bound of ( log d log log d ) on the competitive ratio of randomized algorithms, which is the first result for randomized algorithms and is asymptotically tight. Finally, we analyze the widely used "power of two choices' algorithm for vector scheduling, and show that its competitive ratio is O(log log n+ log d log log d ), which is optimal up to the additive O(log log n) term that also appears in the scalar version of this algorithm.

UR - http://www.scopus.com/inward/record.url?scp=85045579097&partnerID=8YFLogxK

U2 - 10.1137/1.9781611975031.63

DO - 10.1137/1.9781611975031.63

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85045579097

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 990

EP - 991

BT - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

A2 - Czumaj, Artur

PB - Association for Computing Machinery

T2 - 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

Y2 - 7 January 2018 through 10 January 2018

ER -

Randomized algorithms for online vector load balancing

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this