History-Independent Load Balancing
Michael A. Bender, William Kuszmaul, Elaine Shi, Rose Silver
Abstract
We show that there exists a (strongly) history-independent two-choice balls-and-bins algorithm that supports both insertions and deletions on a set of up to balls, while guaranteeing a maximum load of with high probability, and achieving an expected recourse of per operation. To the best of our knowledge, this is the first history-independent solution to achieve nontrivial guarantees of any sort for , and is the first fully dynamic solution (history independent or not) to achieve overload with expected recourse.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
Lineage
Builds on2
Related papers
- Balls and Bins and the Infinite Process with Random DeletionsPetra Berenbrink, Tom Friedetzky, Peter Kling, Lars NagelSODA 2026
- Load balancing with dynamic set of balls and binsAnders Aamand, Jakob Bæk Tejs Knudsen, Mikkel ThorupSTOC 2021 · 4 citations
- Linear Hashing Is OptimalMichael Jaber, Vinayak M. Kumar, David ZuckermanSTOC 2025 · 1 citation
- Balanced Allocations with Heterogeneous Bins: The Power of MemoryDimitrios Los, Thomas Sauerwald, John SylvesterSODA 2023 · 5 citations
- The power of two choices in graphical allocationNikhil Bansal, Ohad N. FeldheimSTOC 2022 · 5 citations
