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
Comparative Analysis of Various Evolutionary Techniques of Load Balancing: A Review
TL;DR: This review paper is to analyze and compare various swarm intelligence evolutionary techniques of load balancing and conclude the best optimum technique among them.
Journal Article
Interprocessor communication with limited memory
Ali Pinar,Bruce Hendrickson +1 more
TL;DR: In this article, the minimum phase remapping problem is formulated as an instance of multi-commodity flow, and a model for optimizing the exchange of messages under such circumstances is proposed.
Book ChapterDOI
Fast Priority Queues for Parallel Branch-and-Bound
TL;DR: Currently used parallel best first branch-and-bound algorithms either suffer from contention at a centralized priority queue or can only approximate the best first strategy.
Book ChapterDOI
ReCoNets—Design Methodology for Embedded Systems Consisting of Small Networks of Reconfigurable Nodes and Connections
TL;DR: This chapter will present the ReCoNets approach for increasing reliability and flexibility of automotive, avionic or body-area networks by solving the hardware/software codesign problem online.
Journal ArticleDOI
Interprocessor communication with limited memory
Ali Pinar,Bruce Hendrickson +1 more
TL;DR: This work proposes a model for optimizing the exchange of messages under such circumstances which is called the minimum phase remapping problem, and first shows that the problem is NP-complete, and then analyzes several methodologies for addressing it.
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