Balls into non-uniform bins
This paper investigates randomised multiple-choice balls-into-bins games. Such a balls-into-bins game models the allocation of tasks to servers of different speeds/capacities. It is shown that a balanced allocation can be achieved if the number of balls equals the total capacity. Simulations of other cases suggest that our algorithm works even for a small amount of balls and bins.
balls-into-bins games load balancing randomised algorithms