Balanced Allocation: Patience is not a Virtue
SODA '16: Symposium on Discrete Algorithms Arlington Virginia January, 2016, pp. 655-671, 2016.
Load balancing is a well-studied problem, with balls-in-bins being the primary framework. The greedy algorithm Greedy[d] of Azar et al. places each ball by probing d > 1 random bins and placing the ball in the least loaded of them. It ensures a maximum load that is exponentially better than the strategy of placing each ball uniformly at r...More
PPT (Upload PPT)