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
Proceedings ArticleDOI
Load balancing for sustainable ICT
TL;DR: The herein paper addresses the issue of providing a model and guidelines for constructing a sustainable ICT environment at the University of Luxembourg by considering a real-life project that has as aim to provide a sustainable environment for the ICT infrastructure of the university.
Book ChapterDOI
Self-optimization of large scale wildfire simulations
TL;DR: An Autonomic Runtime Manager (ARM) is proposed to dynamically exploit the physics properties of the fire simulation and use them as the basis of the authors' self-optimization algorithm, which shows that the performance of theFire simulation has been improved by 45% when compared with a static portioning algorithm.
Journal ArticleDOI
On Finite Dimension Exchange Algorithms
TL;DR: In this paper, a finite dimension exchange algorithm based on edge-colouring of the underlying graph is presented. But it is not shown that the flows computed by the new algorithm are not minimal.
Journal ArticleDOI
Load Balancing Approaches: Recent Computing Trends
Varsha Thakur,Sanjay Kumar +1 more
TL;DR: This paper presents thorough survey of work addressing on load balancing in recent computing trends, including biased sampling, honey bee, active clustering, and join idle queue, which have been studied.
Proceedings ArticleDOI
Asynchronous Byzantine Approximate Consensus in Directed Networks
TL;DR: A tight necessary and sufficient condition is obtained on the underlying directed communication network for asynchronous Byzantine approximate consensus to be achievable and this condition coincides with the tight condition for synchronous Byzantine exact consensus.
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