Journal ArticleDOI
Dynamic load balancing for distributed memory multiprocessors
TLDR
This paper completely analyze the hypercube network by explicitly computing the eigenstructure of its node adjacency matrix and shows that a diffusion approach to load balancing on a hypercube multiprocessor is inferior to another approach which is called the dimension exchange method.About:
This article is published in Journal of Parallel and Distributed Computing.The article was published on 1989-10-01. It has received 1074 citations till now. The article focuses on the topics: Hypercube & Load balancing (computing).read more
Citations
More filters
Proceedings ArticleDOI
On distributed averaging algorithms and quantization effects
Posted Content
Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols
Nicolas Loizou,Peter Richtárik +1 more
TL;DR: This work shows how classical randomized iterative methods for solving linear systems can be interpreted as gossip algorithms when applied to special systems encoding the underlying network and explains in detail their decentralized nature.
Proceedings ArticleDOI
Privacy-Preserving Average Consensus on Directed Graphs Using Push-Sum
TL;DR: A novel average consensus approach for directed graphs which can protect the state privacy of participating nodes without the assistance of any trusted third party or aggregator by leveraging the inherent robustness of consensus dynamics to embed privacy in random coupling weights between interacting nodes.
Posted Content
Privacy preserving randomized gossip algorithms
TL;DR: This work presents three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes.
Dimension-Exchange Algorithms for Load Balancing on Trees.
TL;DR: A logarithmic upper bound on the discrepancy of the final distribution is established, and a new algorithm, which assuming each node has knowledge of the total number of nodes, determines a perfectly balanced distribution is introduced.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
Matrix iterative analysis
TL;DR: In this article, the authors propose Matrix Methods for Parabolic Partial Differential Equations (PPDE) and estimate of Acceleration Parameters, and derive the solution of Elliptic Difference Equations.
Related Papers (5)
Consensus problems in networks of agents with switching topology and time-delays
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Ali Jadbabaie,Jie Lin,A.S. Morse +2 more