Graphical balanced allocations and the (1 + β)-choice process

DOI10.1002/rsa.20558zbMath1347.68365OpenAlexW2099160142MaRDI QIDQ3460518

Yuval Peres, Udi Wieder, Kunal Talwar

Publication date: 7 January 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20558

zbMATH Keywords

load balancingballs and binsrandomized processesbalanced allocationstwo-choice scheme

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (9)

The power of online thinning in reducing discrepancy ⋮ Long-term balanced allocation via thinning ⋮ Balanced allocation on hypergraphs ⋮ The Power of Filling in Balanced Allocations ⋮ Balanced allocation on dynamic hypergraphs ⋮ Load balancing under \(d\)-thinning ⋮ Balanced Allocation on Graphs: A Random Walk Approach ⋮ The power of thinning in balanced allocation ⋮ Dynamic averaging load balancing on cycles

Cites Work

• Randomized allocation processes
• How asymmetry helps load balancing
• Balanced allocation on graphs
• Balanced Allocations
• Balanced Allocations: The Heavily Loaded Case

This page was built for publication: Graphical balanced allocations and the (1 + β)-choice process