Proceedings ArticleDOI
Near-perfect load balancing by randomized rounding
Tobias Friedrich,Thomas Sauerwald +1 more
- pp 121-130
TLDR
It is proved that in comparison to the corresponding model of Rabani, Sinclair, and Wanka (1998) with arbitrary roundings, the randomization yields an improvement of roughly a square root of the achieved discrepancy in the same number of time-steps on all graphs.Abstract:
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and minimum load. In every time-step paired processors balance their load as evenly as possible. The direction of the excess token is chosen according to a randomized rounding of the participating loads.We prove that in comparison to the corresponding model of Rabani, Sinclair, and Wanka (1998) with arbitrary roundings, the randomization yields an improvement of roughly a square root of the achieved discrepancy in the same number of time-steps on all graphs. For the important case of expanders we can even achieve a constant discrepancy in O(log n (log log n)3) rounds. This is optimal up to loglog-factors while the best previous algorithms in this setting either require ©(log2 n) time or can only achieve a logarithmic discrepancy. Our new result also demonstrates that with randomized rounding the difference between discrete and continuous load balancing vanishes almost completely.read more
Citations
More filters
Proceedings ArticleDOI
HiFi: Hybrid Rule Placement for Fine-Grained Flow Management in SDNs
TL;DR: Both experimental and simulation results show that HiFi can reduce the number of required flow entries and reduce the control overhead by 28%-50% compared with the state-of-the-art approaches for achieving fine-grained flow management.
DissertationDOI
Dynamic load balancing in parallel particle methods
TL;DR: In DLB, one is interested in making fast corrections to the load imbalance, and tries to avoid a brand new subdomain-to-PE assignment.
Posted Content
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
TL;DR: In this article, the authors present a protocol for rumor spreading with high probability, which can spread a rumor in O(log n) rounds and uses O(tilde{O}(log log n) random bits in total.
Journal Article
Load Balancing in Distributed Systems using Diffusion Technique
TL;DR: A new dynamic load balancing algorithm is proposed based on diffusion approach (DDD) for homogeneous systems where the processing capacities of all nodes in the system are equal and the proposed algorithm works iteratively to balance the load among the nodes in a system.
Proceedings ArticleDOI
A randomized, o(log w)-depth 2 smoothing network
TL;DR: A very simple, randomized network which meets all four desiderata, and achieves smoothness K = 2, which is optimal with respect to smoothness due to a recent improbability result about randomized, small-depth, 1-smoothing networks.
References
More filters
Journal ArticleDOI
Randomized gossip algorithms
TL;DR: This work analyzes the averaging problem under the gossip constraint for an arbitrary network graph, and finds that the averaging time of a gossip algorithm depends on the second largest eigenvalue of a doubly stochastic matrix characterizing the algorithm.
Journal ArticleDOI
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
TL;DR: In this paper, the relation between a class of 0-1 integer linear programs and their rational relaxations was studied and a randomized algorithm for transforming an optimal solution of a relaxed problem into a provably good solution for the 0 -1 problem was given.
Journal ArticleDOI
Randomized broadcast in networks
TL;DR: This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.
Journal ArticleDOI
Counting networks
TL;DR: Two counting network constructions are given that avoid the sequential bottlenecks inherent to earlier solutions and substantially lower the memory contention, and are provided with experimental evidence that they outperform conventional synchronization techniques under a variety of circumstances.
Proceedings ArticleDOI
Local divergence of Markov chains and the analysis of iterative load-balancing schemes
TL;DR: This work develops a general technique for the quantitative analysis of iterative distributed load balancing schemes, and applies this technique to obtain bounds on the number of rounds required to achieve coarse balancing in general networks, cycles and meshes in these models.