Balanced allocations

Y. Azar, A. Z. Broder, A. R. Karlin, E. Upfal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability inn/ in In n(l + o(l)) balls in it. Suppose instead, that for each ball we choose two boxes at random and place the ball into the one which is less full at the time of placement. We show that with high probability, the fullest box contains only in in n/ in 2+0(1) balls - exponentially less than before. Furthermore, we show that a similar gap exists in the infinite process, where at each step one ball, chosen uniformly at random, is deleted, and one ball is added in the manner above. We discuss consequences of this and related theorems for dynamic resource allocation, hashing, and on-line load balancing.

Original languageEnglish
Title of host publicationProceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994
PublisherAssociation for Computing Machinery
Number of pages10
ISBN (Electronic)0897916638
StatePublished - 23 May 1994
Event26th Annual ACM Symposium on Theory of Computing, STOC 1994 - Montreal, Canada
Duration: 23 May 199425 May 1994

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
VolumePart F129502
ISSN (Print)0737-8017


Conference26th Annual ACM Symposium on Theory of Computing, STOC 1994


Dive into the research topics of 'Balanced allocations'. Together they form a unique fingerprint.

Cite this