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

The generalized dimension exchange method for load balancing in k -ary n -cubes and variants

TL;DR: This paper derives the optimal lambda′s for the k -ary n -cube network and its variants-the ring, the torus, the chain, and the mesh, and concludes that the GDE method favors high-dimensional k -ARY n -cubes.
Journal ArticleDOI

Dynamic task scheduling using online optimization

TL;DR: This paper introduces the self-adjusting dynamic scheduling (SADS) class of algorithms that use a unified cost model to explicitly account for these factors at runtime.
Proceedings ArticleDOI

A new diffusion-based multilevel algorithm for computing graph partitions of very high quality

TL;DR: Besides proving that BUBBLE-FOS/C converges towards a local optimum, this paper develops a much faster method for the improvement of partitionings, based on a different diffusive process, which is restricted to local areas of the graph and also contains a high degree of parallelism.
Proceedings ArticleDOI

Dynamic Load Balancing of SAMR Applications on Distributed Systems

TL;DR: Experiments show that by using the proposed distributed DLB scheme for Structured Adaptive Mesh Refinement applications on distributed systems, the execution time can be reduced by 9%-46% as compared to using parallelDLB scheme which does not consider the heterogeneous and dynamic features of distributed systems.
Journal ArticleDOI

Towards worst-case churn resistant peer-to-peer systems

TL;DR: This article devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary who continuously adds and removes peers and present a system which maintains small peer degree and network diameter.
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.
Journal ArticleDOI

Matrix Iterative Analysis

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)