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
DLBEM: Dynamic load balancing using expectation-maximization
Han Zhao,Xinxin Liu,Xiaolin Li +2 more
TL;DR: Simulation results demonstrate that DLBEM approach achieves even resource utilization and over 90% accuracy in the estimation of the global system state information with over 70% reduction on communication overheads compared to a baseline strategy.
Journal ArticleDOI
Parallel hybrid mesh adaptation by refinement and coarsening
TL;DR: A robust adaptation method for hybrid mesh including both refinement and coarsening, which means that the structures of shocks and vortices are resolved better and the computing load is rebalanced.
The Optimal Property of Polynomial Based Diffusion-Like Algorithms in Dynamic Load Balancing
Y. F. Hu,R. J. Blake +1 more
TL;DR: It is proved that all diffusion- like algorithm has an interesting minimum norm prop- erty in the sense that the weighted Euclidean norm of the amount of load migration generated by the algorithm is minimized.
Proceedings ArticleDOI
Efficient Dispersion of Mobile Robots on Dynamic Graphs
TL;DR: In this article, it was shown that the dispersion problem is intractable in the local communication model, where a robot can only communicate with other robots that are present at the same node.
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