Dynamic Load Balancing by Random Matchings
Bhaskar Ghosh,S. Muthukrishnan +1 more
- Vol. 53, Iss: 3, pp 357-370
Reads0
Chats0
TLDR
This paper considers a new model for load movement in synchronous machines that works on networks of arbitrary topology under possible failure of links and presents an efficient local algorithm for the dynamic load balancing problem under this model.Abstract:
The fundamental problems in dynamic load balancing and job scheduling in parallel and distributed networks involve moving load between processors. In this paper we consider a new model for load movement in synchronous machines. In each step of our model, load can be moved across only a matching set of communication links but across each link any amount of load can be moved. We present an efficient local algorithm for the dynamic load balancing problem under our model of load movement. Our algorithm works on networks of arbitrary topology under possible failure of links. The running time of our algorithm is related to the eigenstructure of the underlying graph. We also present experimental results analyzing issues in load balancing related to our algorithms.read more
Citations
More filters
Journal ArticleDOI
Gossip Algorithms for Distributed Signal Processing
TL;DR: An overview of recent gossip algorithms work, including convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping, and the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.
Journal ArticleDOI
Gossip-based aggregation in large dynamic networks
TL;DR: This work proposes a gossip-based protocol for computing aggregate values over network components in a fully decentralized fashion and demonstrates the efficiency and robustness of the protocol both theoretically and experimentally under a variety of scenarios including node and communication failures.
Journal ArticleDOI
Quantized consensus
TL;DR: This work describes simple randomized distributed algorithms which achieve consensus to the extent that the discrete nature of the problem permits.
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.
Journal ArticleDOI
Robust Computation of Aggregates in Wireless Sensor Networks: Distributed Randomized Algorithms and Analysis
TL;DR: This paper presents and analyze a suite of randomized distributed algorithms to efficiently and robustly compute aggregates and uses the eigen-structure of the underlying graph in a novel way to show convergence and to bound the running time of the algorithms.
References
More filters
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Journal ArticleDOI
Efficient dispersal of information for security, load balancing, and fault tolerance
TL;DR: Information Dispersal Algorithm (IDA) has numerous applications to secure and reliable storage of information in computer networks and even on single disks, to fault-tolerant and efficient transmission ofInformation in networks, and to communications between processors in parallel computers.
Journal ArticleDOI
Eigen values and expanders
Noga Alon,Noga Alon +1 more
TL;DR: It is shown that a regular bipartite graph is an expanderif and only if the second largest eigenvalue of its adjacency matrix is well separated from the first.
Journal ArticleDOI
A simple parallel algorithm for the maximal independent set problem
TL;DR: Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem.
Related Papers (5)
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Ali Jadbabaie,Jie Lin,A.S. Morse +2 more