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
Dissertation
Équilibrage de charge et redistribution de données sur plates-formes hétérogènes
TL;DR: The problem of redistributing data onto heterogeneous platforms, an operation induced by possible variations in the resource performances or in the system/application requirements, is considered, and an optimal solution for light redistributions is derived.
Dissertation
Reliable middleware framework for rfid system
TL;DR: This research investigates system software solutions for achieving a highly reliable deployment that mitigates inherent unreliability in RFID technology and provides a scalable, reliable system architecture for item tracking applications.
Journal ArticleDOI
Clustering IBM Enterprise System/3090 computers for parallel execution of FORTRAN programs
TL;DR: The modifications and the motivations behind them are discussed, and the performance of several applications executed with Clustered FORTRAN is summarized, which describes how clustering has been used to improve performance in novel ways.
Applying Self-Aggregation to Load Balancing: Experimental Results
Elisabetta Di Nitto,Daniel J. Dubois,Raffaela Mirandola,Fabrice Saffre,Richard Edward Tateson +4 more
TL;DR: In this paper, autonomic self-aggregation techniques are used to rewire highly dynamic systems in groups of homogeneous nodes that are then able to balance the load among each others.
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