Quasirandom load balancing
Tobias Friedrich,Martin Gairing,Thomas Sauerwald +2 more
- pp 1620-1629
TLDR
It is shown that first-passage probabilities of a random walk on a path with arbitrary weights can be expressed as a convolution of independent geometric probability distributions and the quasirandom algorithm is the first known algorithm for this setting which is optimal both in time and achieved smoothness.Abstract:
We propose a simple distributed algorithm for balancing indivisible tokens on graphs The algorithm is completely deterministic, though it tries to imitate (and enhance) a random algorithm by keeping the accumulated rounding errors as small as possibleOur new algorithm approximates the idealized process (where the tokens are divisible) on important network topologies surprisingly closely On d-dimensional torus graphs with n nodes it deviates from the idealized process only by an additive constant In contrast to that, the randomized rounding approach of Friedrich and Sauerwald [8] can deviate up to Ω(polylog n) and the deterministic algorithm of Rabani, Sinclair and Wanka [23] has a deviation of Ω(n1/d) This makes our quasirandom algorithm the first known algorithm for this setting which is optimal both in time and achieved smoothness We further show that also on the hypercube our algorithm has a smaller deviation from the idealized process than the previous algorithmsTo prove these results, we derive several combinatorial and probabilistic results that we believe to be of independent interest In particular, we show that first-passage probabilities of a random walk on a path with arbitrary weights can be expressed as a convolution of independent geometric probability distributionsread more
Citations
More filters
Proceedings ArticleDOI
Quasirandom rumor spreading
TL;DR: A quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading") that achieves similar or better broadcasting times with a greatly reduced use of random bits.
Proceedings ArticleDOI
Sharp bounds by probability-generating functions and variable drift
TL;DR: To the runtime analysis of evolutionary algorithms two powerful techniques are introduced: probability-generating functions and variable drift analysis, which are shown to provide a clean framework for proving sharp upper and lower bounds.
Journal ArticleDOI
Quasirandom Rumor Spreading
TL;DR: A quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading") that achieves similar or better broadcasting times with a greatly reduced use of random bits.
Proceedings ArticleDOI
Quasirandom evolutionary algorithms
TL;DR: Different variations of the classical (1+1) evolutionary algorithm, all imitating the property that the (1-1) EA over intervals of time touches all bits roughly the same number of times are proposed.
Proceedings ArticleDOI
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
Thomas Sauerwald,He Sun +1 more
TL;DR: This work investigates several randomized protocols for different communication models in the discrete case of discrete load balancing and demonstrates that there is almost no difference between the discrete and continuous case.
References
More filters
Book
Spectral Graph Theory
TL;DR: Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigen values and quasi-randomness
Journal ArticleDOI
Introduction to Probability Models.
TL;DR: There is a comprehensive introduction to the applied models of probability that stresses intuition, and both professionals, researchers, and the interested reader will agree that this is the most solid and widely used book for probability theory.
Book
Randomized Algorithms
TL;DR: This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.
Book
Probability and random processes
TL;DR: In this article, the authors present a survey of the history and varieties of probability for the laws of chance and their application in the context of Markov chains convergence of random variables.
Random Walks on Graphs: A Survey
TL;DR: Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling.