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
DDE: A Modified Dimension Exchange Method for Load Balancing in k-ary n-cubes
Min-You Wu,Wei Shu +1 more
TL;DR: A new algorithm is proposed, the Direct Dimension Exchange (DDE) method, which takes load average in every dimension without iteratively exchanging the load, which is able to balance the load more accurately and much faster.
ReportDOI
Using a Transfer Function to Describe the Load-Balancing Problem
TL;DR: The dynamic load-balancing problem for mesh-connected parallel computers can be clearly described by introducing a function that identifies how much work is to be transmitted between neighboring processors.
Posted Content
Criteria for Unconditional Convergence to Single or Multiple Consensuses in Discrete Time Linear Consensus Algorithms
Sadegh Bolouki,Roland P. Malhamé +1 more
TL;DR: In this article, it was shown that the asymptotic unconditional occurrence of single consensus or multiple consensuses is directly related to the property of absolute infinite flow of this sequence, as introduced by Touri and Nedic.
Operating System Support for Resilience
TL;DR: The approach is to dynamically replicate processes, detect inconsistencies in their behavior, and transparently restore the level of fault tolerance as a computation proceeds, through a collection of operating system mechanisms for process replication, migration, and migration.
Book
Dynamics and Cooperation: Algorithmic Challenges in Peer-to-Peer Computing
TL;DR: A mathematical framework is introduced which allows us to evaluate a system’s robustness to malicious attacks and which applies algorithms that maintain desirable network properties despite worst-case joins and leaves; these algorithms can also be used for pancake graphs.
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