Parallel randomized load balancingOpen Website

1998 (modified: 17 Sept 2020)Random Struct. Algorithms 1998Readers: Everyone
Abstract: It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds Θ(log n/log log n) balls with high probability. More recently, Azar et al. analyze...
0 Replies

Loading