Balanced Allocations: The Heavily Loaded Case
From MaRDI portal
Publication:5470738
DOI10.1137/S009753970444435XzbMath1114.68082DBLPjournals/siamcomp/BerenbrinkCSV06WikidataQ60960866 ScholiaQ60960866MaRDI QIDQ5470738
Berthold Vöcking, Angelika Steger, Petra Berenbrink, Artur Czumaj
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Randomized algorithms (68W20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Distributed algorithms (68W15)
Related Items (25)
Balanced Allocation: Patience Is Not a Virtue ⋮ On weighted balls-into-bins games ⋮ Graphical balanced allocations and the (1 + β)-choice process ⋮ Parallel load balancing on constrained client-server topologies ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ The power of online thinning in reducing discrepancy ⋮ On the Power of Choice for Boolean Functions ⋮ Long-term balanced allocation via thinning ⋮ The Power of Filling in Balanced Allocations ⋮ A Power-of-Two-Choices Unbalanced Allocation Process ⋮ Chains-into-bins processes ⋮ Balanced allocation: memory performance tradeoffs ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Self-stabilizing repeated balls-into-bins ⋮ Chains-into-Bins Processes ⋮ Thresholds for extreme orientability ⋮ A generalization of multiple choice balls-into-bins: tight bounds ⋮ Balls into bins via local search: Cover time and maximum load ⋮ Anonymity and k-Choice Identities ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Self-stabilizing balls and bins in batches. The power of leaky bins ⋮ On the \(k\)-orientability of random graphs ⋮ The power of thinning in balanced allocation ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Two-way chaining for non-uniform distributions
This page was built for publication: Balanced Allocations: The Heavily Loaded Case
