Abstract
Suppose we sequentially put
Let us assume now that we have limited amount of memory. For each ball, we are given two random bins and we have to put the ball into one of them. Our goal is to minimize the load of the heaviest bin. We prove that if we have
Citation
Itai Benjamini. Yury Makarychev. "Balanced allocation: Memory performance tradeoffs." Ann. Appl. Probab. 22 (4) 1642 - 1649, August 2012. https://doi.org/10.1214/11-AAP804
Information