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
Gossip-based resource management for cloud environments
TL;DR: This work formalizes the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints and provides an efficient heuristic solution for the complete problem instead.
Proceedings ArticleDOI
Increasing application performance in virtual environments through run-time inference and adaptation
TL;DR: This work shows here how to use the continually inferred application topology and traffic to dynamically control three mechanisms of adaptation, VM migration, overlay topology, and forwarding to significantly increase the performance of two classes of applications, bulk synchronous parallel applications and transactional Web e-commerce applications.
Journal ArticleDOI
On runtime parallel scheduling for processor load balancing
TL;DR: Scheduling algorithms for tree, hypercube, and mesh networks are presented that can fully balance the load and maximize locality at runtime and are significantly reduced compared to other existing algorithms.
Journal ArticleDOI
Mutual visibility by luminous robots without collisions
G. A. Di Luna,Paola Flocchini,S. Gan Chaudhuri,Federico Poloni,Nicola Santoro,Giovanni Viglietta +5 more
TL;DR: This paper provides the first obstructed-visibility solutions to two classical problems for oblivious robots: Collision-less Convergence to a point and Circle Formation and establishes a spectrum of results, depending on the power of the adversary, on the number c of colors, and on the a-priori knowledge the robots have about the system.
Journal ArticleDOI
A Gossip Protocol for Dynamic Resource Management in Large Cloud Environments
TL;DR: This work presents a protocol that computes an optimal solution without considering memory constraints and extends that protocol to provide an efficient heuristic solution for the complete problem, which includes minimizing the cost for adapting an allocation.
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