Balls-into-bins with nearly optimal load distribution
Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre O. Stauffer · 2013
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.