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
Posted Content
Convergence Speed in Distributed Consensus and Control
TL;DR: This work proves lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provides an algorithm that essentially matches those lower bounds.
Proceedings ArticleDOI
Particle swarm optimization schemes based on consensus for wireless sensor networks
TL;DR: Sensors that move according to the well-known Particle Swarm Optimization scheme are considered in order to improve network coverage and energy consumption and it is shown that the proposed techniques obtain remarkable results for both parameters considered.
Proceedings ArticleDOI
Online hardware/software partitioning in networked embedded systems
TL;DR: A discrete iterative algorithm that balances the load of a HW/SW partition online: once there are changing computational demands, the system will dynamically assign tasks to reconfigurable HW or SW resources and migrates tasks to other nodes if necessary.
Journal ArticleDOI
Improving load balance with flexibly assignable tasks
Ali Pinar,Bruce Hendrickson +1 more
TL;DR: This paper model the problem of exploiting flexibility in assignment of tasks to improve load balance in parallel computing in terms of network flow and uses combinatorial techniques for its solution, and considers a continuous version of the problem as a linearly constrained optimization problem.
Journal ArticleDOI
Exploiting biased load information in direct neighbour load balancing policies
TL;DR: Experimental results show that the transmission of biased load information provides high efficiency unless the dynamicity of the load becomes too high, in which case it is preferable to exploit non-biased load information.
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