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
The Liquid Model Load Balancing Method
TL;DR: A new local method, which realizes a physical analogy to equilibrating liquids in multi-dimensional tori or hypercubes, is presented, which is especially suited for communication mechanisms with low set-up to transfer ratio occurring in tightly-coupled or SIMD systems.
Parallel complex systems simulation
TL;DR: This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.
Journal ArticleDOI
On the Stability of Dynamic Diffusion Load Balancing
TL;DR: This paper considers the problem of dynamic load balancing in arbitrary (connected) networks on n nodes such that during each round, n tasks are generated on arbitrary nodes, and then one task is deleted from every non-empty node.
Book ChapterDOI
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow
S. Muthukrishnan,Torsten Suel +1 more
TL;DR: This work proposes a second-order method for accelerating the convergence of the "first-order" distributed algorithms recently proposed by Awerbuch and Leighton and gives valuable insights into the diffusive processes that underly these local-control algorithms.
Proceedings ArticleDOI
Load balancing: dimension exchange on product graphs
TL;DR: One new diffusion and two new dimension-exchange schemes for product graphs are introduced and it is shown that the latter two can achieve nearly minimal communication operations and therefore short run-times.
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