The power of thinning in balanced allocation

07/03/2018
by   Ohad N. Feldheim, et al.
0

Balls are sequentially allocated into n bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new independent uniformly random bin. The goal of the overseer is to reduce the load of the most heavily loaded bin after Θ(n) balls have been allocated. We provide an asymptotically optimal strategy yielding a maximum load of (1+o(1))√(8 n/ n) balls.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2021

Long-term balanced allocation via thinning

We study the long-term behavior of the two-thinning variant of the class...
research
06/13/2020

Balanced Allocation on Dynamic Hypergraphs

The balls-into-bins model randomly allocates n sequential balls into n b...
research
07/04/2018

Optimal Ball Recycling

Balls-and-bins games have been a wildly successful tool for modeling loa...
research
10/05/2018

Balanced Allocation with Random Walk Based Sampling

In the standard ball-in-bins experiment, a well-known scheme is to sampl...
research
04/11/2021

Load Balancing with Dynamic Set of Balls and Bins

In dynamic load balancing, we wish to distribute balls into bins in an e...
research
08/27/2019

Singletons for Simpletons: Revisiting Windowed Backoff using Chernoff Bounds

For the well-known problem of balls dropped uniformly at random into bin...
research
10/20/2021

Balanced Allocations: Caching and Packing, Twinning and Thinning

We consider the sequential allocation of m balls (jobs) into n bins (ser...

Please sign up or login with your details

Forgot password? Click here to reset