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
Journal ArticleDOI
Load balancing for unstructured mesh applications
Y. F. Hu,R. J. Blake +1 more
TL;DR: The history and the state of the art of both classes of algorithms are looked at, with a particular emphasis on mesh based applications.
Proceedings ArticleDOI
Average consensus over small world networks: A probabilistic framework
TL;DR: It is observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms, and a probabilistic framework for analyzing this effect is provided.
Posted Content
Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
Soummya Kar,Jose M. F. Moura +1 more
TL;DR: The paper shows how to use probability bounds on the excursions of the two subsequences to design the quantizer parameters and to explore tradeoffs among the number of quantizer levels, the size of the quantization steps, the desired probability of saturation, and the desired level of accuracy away from consensus.
Journal ArticleDOI
On Decentralized Estimation With Active Queries
TL;DR: This framework provides a flexible and tractable mathematical model for decentralized parameter estimation systems based on active querying for stochastic search over a parameter space and proves convergence to correct consensus on the value of the parameter.
Proceedings ArticleDOI
An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers
TL;DR: This paper compares a couple of fairly well-known nearest neighbor algorithms, the dimension exchange and the diffusion methods and their variants in terms of their performances in both one-port and all-port communication architectures and it turns out that thedimension exchange method outperforms the diffusion method in the one- port communication model.
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