Balanced Allocations: Caching and Packing, Twinning and Thinning

  title={Balanced Allocations: Caching and Packing, Twinning and Thinning},
  author={Dimitrios Los and Thomas Sauerwald and John Sylvester},
We consider the sequential allocation of $m$ balls (jobs) into $n$ bins (servers) by allowing each ball to choose from some bins sampled uniformly at random. The goal is to maintain a small gap between the maximum load and the average load. In this paper, we present a general framework that allows us to analyze various allocation processes that slightly prefer allocating into underloaded, as opposed to overloaded bins. Our analysis covers several natural instances of processes, including: The… 

Figures and Tables from this paper

Balanced Allocations in Batches: Simplified and Generalized
A new analysis of the allocation of m balls (jobs) into n bins (servers) based on exponential potential functions is presented, which includes not only Two-Choice, but also processes with fewer bin samples like (1+β), processes which can only receive one bit of information from each bin sample and graphical allocation, where bins correspond to vertices in a graph.
Balanced Allocations: The Heavily Loaded Case with Deletions
A new strategy is presented, called M ODULATED G REEDY, that guarantees a maximum load of m / n + O ( log m ) , at any given moment, with high probability in m .
Balanced Allocations with Incomplete Information: The Power of Two Queries
This work recovers and generalizes the bound of m/n + O(log log n) on the maximum load achieved by the Two-Choice process, including the heavily loaded case m = Ω(n) which was derived in previous works by Berenbrink et al.
Balanced Allocation on Hypergraphs
The notion of pair visibility is introduced and popular d-choice allocation algorithms with related choices including graphs andhypergraphs models are studied, establishing a lower bound for the maximum load attained by the balanced allocation for a sequence of hypergraphs in terms of Pair visibility.
The Power of Filling in Balanced Allocations
It is well known that if m balls (jobs) are placed sequentially into n bins (servers) according to the One-Choice protocol – choose a single bin in each round and allocate one ball to it – then, for
Tight Bounds for Repeated Balls-into-Bins
We study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta [3]. This process starts with m balls arbitrarily distributed across n bins. At each step t