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… 
1 Citations

Figures and Tables from this paper

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.