@inproceedings{92487892cd8242d3b46be25f9b58f616,
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",
note = "Publisher Copyright: {\textcopyright} Copyright 2018 by SIAM.; 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 ; Conference date: 07-01-2018 Through 10-01-2018",
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",
address = "الولايات المتّحدة",
}