The Gradient Model Load Balancing Method
IEEE Transactions on Software Engineering - Special issue on distributed systems
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Analysis of a graph coloring based distributed load balancing algorithm
Journal of Parallel and Distributed Computing
Load balancing and Poisson equation in a graph
Concurrency: Practice and Experience
A dynamic load-balancing algorithm for molecular dynamics simulation on multi-processor systems
Journal of Computational Physics
Parallel load-balancing: an extension to the gradient model
Parallel Computing
The generalized dimension exchange method for load balancing in k-ary n-cubes and variants
Journal of Parallel and Distributed Computing
Programming a Hypercube Multicomputer
IEEE Software
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
Instantiation of a Generic Model for Load Balancing with Intelligent Algorithms
IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems
A Space-Based Generic Pattern for Self-Initiative Load Balancing Agents
ESAW '09 Proceedings of the 10th International Workshop on Engineering Societies in the Agents World X
| Hi-index | 0.00 |
The main results of this paper are based on the idea that most load balancing algorithms can be described in the framework of optimization theory. It enables to involve classical results linked with convergence, its speed and other elements. We emphasize that these classical results have been found independently and till now this connection has not been shown clearly. In this paper, we analyze the load balancing algorithm based on the steepest descent algorithm. The analysis shows that the speed of convergence is determined by eigenvalues of the Laplacian for the graph of a given load balancing system. This consideration also leads to the problems of choosing an optimal structure for a load balancing system. We prove that these optimal graphs have special Laplacians: the multiplicities of their minimal and maximal positive eigenvalues must be greater than one. Such a property is essential for strongly regular graphs, investigated in algebraic graph theory.