Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Dynamic load balancing by random matchings
Journal of Computer and System Sciences
Meeting times of random walks on graphs
Information Processing Letters
Local Divergence of Markov Chains and the Analysis of Iterative Load-Balancing Schemes
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Gossip-based aggregation in large dynamic networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Managing clouds: a case for a fresh look at large unreliable dynamic networks
ACM SIGOPS Operating Systems Review
Automatica (Journal of IFAC)
Communication constraints in the average consensus problem
Automatica (Journal of IFAC)
Consensus Problem of Multi-Agent Systems with Non-linear Performance Functions
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Distributed Average Consensus using Probabilistic Quantization
SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
On Spatial Gossip Algorithms for Average Consensus
SSP '07 Proceedings of the 2007 IEEE/SP 14th Workshop on Statistical Signal Processing
Distributed Consensus in Multi-vehicle Cooperative Control: Theory and Applications
Distributed Consensus in Multi-vehicle Cooperative Control: Theory and Applications
Consensus control for networks of dynamic agents via active switching topology
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Maximizing network lifetime online by localized probabilistic load balancing
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Hi-index | 0.00 |
In this paper we consider the problem of load balancing over heterogeneous networks, i.e. networks whose nodes have different speeds. We assume that tasks are indivisible and with different weights. Our goal is that of minimizing the maximum execution time over nodes. We provide a gossip-based distributed algorithm whose convergence to a bounded set is guaranteed. We show that the convergence time of the proposed algorithm relies ultimately on the average meeting time between two agents performing a random walk on a graph.