Treffer: Balanced Allocations with the Choice of Noise.

We consider the allocation of m balls (jobs) into n bins (servers). In the standard Two-Choice process, at each step t = 1, 2, . . ., m we first sample two randomly chosen bins, compare their two loads and then place a ball in the least loaded bin. It is well-known that for any m x n, this results in a gap (difference between the maximum and average load) of log2 logn + T(1) (with high probability). In this work, we consider Two-Choice in different settings with noisy load comparisons. One key setting involves an adaptive adversary whose power is limited by some threshold N. In each step, such adversary can determine the result of any load comparison between two bins whose loads differ by at most, while if the load difference is greater than, the comparison is correct. For this adversarial setting, we first prove that for anym x n the gap is O(1 + logn) with high probability. Then through a refined analysiswe prove that if x logn, then for anym x n the gap is O(1 log 1 ·log logn). For constant values of 1, this generalizes the heavily loaded analysis of [19, 61] for the Two-Choice process, and establishes that asymptotically the same gap bound holds even if load comparisons among "similarly loaded" bins are wrong. Finally, we complement these upper bounds with tight lower bounds, which establish an interesting phase transition on how the parameter 1 impacts the gap. The analysis also applies to settings with outdated and delayed information. For example, for the setting of [18] where balls are allocated in consecutive batches of size b = n, we present an improved and tight gap bound of T(log n log log n). This bound also extends for a range of values of b and applies to a relaxed setting where the reported load of a bin can be any load value from the last b steps. [ABSTRACT FROM AUTHOR]

Copyright of Journal of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)