Multiple-Choice Balanced Allocation in (Almost) Parallel

@inproceedings{Berenbrink2012MultipleChoiceBA,
  title={Multiple-Choice Balanced Allocation in (Almost) Parallel},
  author={Petra Berenbrink and Artur Czumaj and Matthias Englert and Tom Friedetzky and Lars Nagel},
  booktitle={APPROX-RANDOM},
  year={2012}
}
We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches. We study this scenario in an abstract framework of allocating balls into bins. We revisit the allocation algorithm GREEDY[2] due to Azar, Broder, Karlin, and Upfal (SIAM J. Comput. 1999), in which, for sequentially arriving balls, each ball chooses two bins at random, and gets placed into one of those two bins with minimum load. The maximum load of any… CONTINUE READING

From This Paper

Topics from this paper.
9 Citations
16 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…