Balls-into-bins with nearly optimal load distribution

Authors:
Petra Berenbrink;Kamyar Khodamoradi;Thomas Sauerwald;Alexandre Stauffer
Affiliations:
Simon Fraser University, Burnaby, BC, Canada;Simon Fraser University, Burnaby, BC, Canada;Max Planck Institute for Informatics, Saarbrüken, Germany;University of Bath, Bath, United Kingdom
Venue:
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2013

Citing 12
Cited 0

A dynamic distributed load balancing algorithm with provable good performance

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Parallel randomized load balancing

Random Structures & Algorithms
Competitive routing of virtual circuits with unknown duration

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Tight Analyses of Two Local Load Balancing Algorithms

SIAM Journal on Computing
Balanced Allocations

SIAM Journal on Computing
Randomized allocation processes

Random Structures & Algorithms
Load Balancing with Memory

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
"Balls into Bins" - A Simple and Tight Analysis

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
How asymmetry helps load balancing

Journal of the ACM (JACM)
Balanced Allocations: The Heavily Loaded Case

SIAM Journal on Computing
Concentration of Measure for the Analysis of Randomized Algorithms

Concentration of Measure for the Analysis of Randomized Algorithms
Tight thresholds for cuckoo hashing via XORSAT

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider sequential balls-into-bins processes that randomly allocate m balls into n bins. We analyze two allocation schemes that achieve a close to optimal maximum load of ⌈m/n⌉ + 1 and require only O(m) (expected) allocation time. These parameters should be compared with the classic d-choice-process which achieves a maximum load of m/n + log log n/d + O(1) and requires m • d allocation time.