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 algorithms based on gradient methods and their analysis through algebraic graph theory
TL;DR: It is proved that these optimal graphs have special Laplacians: the multiplicities of their minimal and maximal positive eigenvalues must be greater than one, essential for strongly regular graphs, investigated in algebraic graph theory.
Proceedings ArticleDOI
An efficient dynamic load balancing using the dimension exchange method for balancing of quantized loads on hypercube multiprocessors
TL;DR: A new method is proposed which reduces the maximum difference by half to [1/2 log N] and is proved both by analysis of possible cases incrementing the difference on each phase of balancing and by enumerating all possible combination of load for hypercubes of limited sizes using a computer.
Journal ArticleDOI
Randomized diffusion for indivisible loads
TL;DR: In this paper, several upper bounds on the load discrepancy for general networks are proved, which depend on some expansion properties of the network, that is, the second largest eigenvalue, and a novel measure which is referred to as refined local divergence.
Journal ArticleDOI
Motion-Communication Co-Optimization With Cooperative Load Transfer in Mobile Robotics: An Optimal Control Perspective
TL;DR: This paper considers a team of robots tasked with collectively transmitting a given amount of data to a remote station while operating in realistic communication environments that experience path loss, shadowing, and multipath fading, and designs the load distribution, paths, and transmission power/rate schedules of the robots in a way that minimizes the total energy required for motion and communication.
Proceedings ArticleDOI
Distributed selfish load balancing with weights and speeds
TL;DR: In this article, the authors considered neighborhood load balancing in the context of selfish clients, where the objective of the user is to allocate his/her task to a processor with minimum load, defined as the weight of its tasks divided by its speed.
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