scispace - formally typeset
Journal ArticleDOI

Dynamic load balancing for distributed memory multiprocessors

George Cybenko
- 01 Oct 1989 - 
- Vol. 7, Iss: 2, pp 279-301
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

Consensus and Cooperation in Networked Multi-Agent Systems

TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.
Proceedings ArticleDOI

A scheme for robust distributed sensor fusion based on average consensus

TL;DR: This work proposes a simple distributed iterative scheme, based on distributed average consensus in the network, to compute the maximum-likelihood estimate of the parameters, and shows that it works in a network with dynamically changing topology, provided that the infinitely occurring communication graphs are jointly connected.
Journal ArticleDOI

Distributed average consensus with least-mean-square deviation

TL;DR: The problem of finding the (symmetric) edge weights that result in the least mean-square deviation in steady state is considered and it is shown that this problem can be cast as a convex optimization problem, so the global solution can be found efficiently.
BookDOI

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms

TL;DR: This self-contained introduction to the distributed control of robotic networks offers a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation.
Proceedings ArticleDOI

Convergence in Multiagent Coordination, Consensus, and Flocking

TL;DR: An old distributed algorithm for reaching consensus that has received a fair amount of recent attention is discussed, in which a number of agents exchange their values asynchronously and form weighted averages with (possibly outdated) values possessed by their neighbors.
References
More filters
Proceedings ArticleDOI

Parallel Algorithms For Classification And Clustering

TL;DR: Parallel algorithms for high level signal processing functions common to tracking and data fusion, implemented on a hypercube parallel computer and performance data is presented.

Dynamic remapping decisions in multi-phase parallel computations. Final report

D.M. Nicol, +1 more
TL;DR: In this paper, the authors consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility, and they show that the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold.

Dynamic remapping decisions in multi-phase parallel computations

TL;DR: The results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.
Related Papers (5)