Papers › Balanced Allocations with the Choice of Noise
Balanced Allocations with the Choice of Noise
Dimitrios Los, Thomas Sauerwald
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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≥n, this results in a gap (difference between the maximum and average load) of log₂logn+Θ(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 g∈ℕ. In each step, such adversary can determine the result of any load comparison between two bins whose loads differ by at most g, while if the load difference is greater than g, the comparison is correct. For this adversarial setting, we first prove that for any m ≥n the gap is O(g+logn) with high probability. Then through a refined analysis we prove that if g≤logn, then for any m ≥n the gap is O(g/logg·loglogn). For constant values of g, this generalizes the heavily loaded analysis of [BCSV06, TW14] 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 g impacts the gap. The analysis also applies to settings with outdated and delayed information. For example, for the setting of [BCEFN12] where balls are allocated in consecutive batches of size b=n, we present an improved and tight gap bound of Θ(logn/loglogn). 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections