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
Deep Learning-Based Average Consensus
TL;DR: A data-driven approach to tuning the weights of temporal networks using deep learning techniques, which can achieve a significantly smaller consensus error compared to baseline strategies and can be extended for infinite-time window problems.
Book ChapterDOI
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.
Evaluation of Load Balancing Strategies
Haroon Rashid,Usman Aftab +1 more
TL;DR: In this article, the authors have studied behaviors of a few such algorithms, i.e., fixed granularity, variable granularity (guided self scheduling), and global centralized task migration (4) algorithms.
Posted Content
Push sum with transmission failures
TL;DR: The push-sum algorithm allows distributed computing of the average on a directed graph, and is particularly relevant when one is restricted to one-way and/or asynchronous communications.
Journal ArticleDOI
A Novel Collaborative Task Offloading Scheme for Secure and Sustainable Mobile Cloudlet Networks
TL;DR: The proposed CTOM, a novel collaborative task offloading scheme based on the balls-and-bins theory, outperforms the conventional random and proportional allocation schemes in reducing the task gaps between maximum load and minimum load among mobile cloudlets by 65% and 55%, respectively.
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