Well-Balanced Allocation on General Graphs

by   Nikhil Bansal, et al.

We study the graphical generalization of the 2-choice balls-into-bins process, where rather than choosing any two random bins, the bins correspond to vertices of an underlying graph, and only the bins connected by an edge can be chosen. For any k(n) edge-connected, d(n)-regular graph on n vertices and any number of balls, we give an allocation strategy which guarantees that the maximum gap between the bin loads is O((d/k) log^4n loglog n), with high probability. We further show that the dependence on k is tight and give an Ω((d/k) + log n) lower bound on the gap achievable by any allocation strategy, for any graph G. In particular, our result gives polylogarithmic bounds for natural graphs such as cycles and tori, where the classical greedy allocation appears to result in a polynomial gap. Previously such a bound was known only for graphs with good expansion. The construction is based on defining certain orthogonal flows on cut-based Räcke decomposition of graphs. The allocation algorithm itself, however, is simple to implement and takes only O(log(n)) time per allocation, and can be viewed as a global version of the greedy strategy that compares average load on sets of vertices, rather than on individual vertices.



There are no comments yet.


page 1

page 2

page 3

page 4


Dynamic Averaging Load Balancing on Cycles

We consider the following dynamic load-balancing process: given an under...

Connected greedy colouring in claw-free graphs

An ordering of the vertices of a graph is connected if every vertex (but...

Long-term balanced allocation via thinning

We study the long-term behavior of the two-thinning variant of the class...

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly

The Grundy number of a graph is the maximum number of colours used by th...

Confining the Robber on Cographs

In this paper, the notions of trapping and confining the robber on a gra...

Balanced Allocations with Incomplete Information: The Power of Two Queries

We consider the problem of allocating m balls into n bins with incomplet...

A Timecop's Chase Around the Table

We consider the cops and robber game variant consisting of one cop and o...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.