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
Fast discrete consensus based on gossip for makespan minimization in networked systems
TL;DR: The convergence time of the proposed algorithm is superior with respect to the state of the art of discrete and quantized consensus by at least a factor O ( n ) in both theoretical and empirical comparisons.
Proceedings ArticleDOI
A Two-layer Architecture of Mobile Sinks and Static Sensors
TL;DR: The MSSSN architecture provides scalability, extends sensor lifetime by letting them operate with limited transmission range and provides connectivity between isolated regions of sensor nodes.
Proceedings ArticleDOI
Approximate consensus in multi-agent nonlinear stochastic systems
TL;DR: New upper bounds for mean square distance between the initial system and its approximate average model are proposed and used to obtain conditions for approximate consensus achievement and the system is evaluated analytically and by simulations.
Journal ArticleDOI
Accelerated diffusion algorithms for dynamic load balancing
TL;DR: This paper compares the application of Semi-Iterative, Second Degree and Variable Extrapolation techniques on the basic diffusion method for various types of network graphs.
Journal ArticleDOI
Algorithms for leader selection in stochastically forced consensus networks
TL;DR: In this article, the authors show that the Boolean constraints (a node is either a leader or it is not) are the only source of nonconvexity in networks with leaders subject to noise.
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