Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
Load balancing and Poisson equation in a graph
Concurrency: Practice and Experience
Performance characteristics of a load balancing algorithm
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
An improved diffusion algorithm for dynamic load balancing
Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
Efficient schemes for nearest neighbor load balancing
Parallel Computing - Special issue on parallelization techniques for numerical modelling
Diffusive load balancing schemes on heterogeneous networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Matrix analysis and applied linear algebra
Matrix analysis and applied linear algebra
Load Balancing in Parallel Computers: Theory and Practice
Load Balancing in Parallel Computers: Theory and Practice
Strategies for Dynamic Load Balancing on Highly Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
A Practical Approach to Dynamic Load Balancing
IEEE Transactions on Parallel and Distributed Systems
Heterogeneous Dynamic Load Balancing
IWCC '01 Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers
Engineering Diffusive Load Balancing Algorithms Using Experiments
IRREGULAR '97 Proceedings of the 4th International Symposium on Solving Irregularly Structured Problems in Parallel
Isoperimetric Inequalities for Cartesian Products of Graphs
Combinatorics, Probability and Computing
EDAS: providing an environment for decentralized adaptive services
DSM '05 Proceedings of the 2nd international doctoral symposium on Middleware
A decentralized resource allocation policy in minigrid
Future Generation Computer Systems
Distributed average consensus with least-mean-square deviation
Journal of Parallel and Distributed Computing
Distributed Jacobi joint diagonalization on clusters of personal computers
International Journal of Parallel Programming
Perfect load balancing on the star interconnection network
The Journal of Supercomputing
Fast load balancing with the most to least loaded policy in dynamic networks
The Journal of Supercomputing
A delay-based dynamic load balancing method and its stability analysis and simulation
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Design and analysis of the M2LL policy distributed algorithm for load balancing in dynamic networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Roles of agents in data-intensive web sites
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Cooperation in multi-organization scheduling
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
The distributed environments constitute a major option for the future development of high-performance computing. In order to be able to efficiently execute parallel applications on such systems, one should ensure a fair utilization of the available resources. Here, we address a number of aspects regarding the generalization of the diffusion algorithms for the case when the processors have different relative speeds and the communication parameters have different values. Although some work has been done in this direction, we propose complementary results and we investigate other variants than those commonly used. In a first step, we discuss general aspects of the generalized diffusion. Bounds are formulated for the convergence factor and an explicit expression is given for the migration flow generated by such algorithms. It is shown that this flow has an important property, that is a scaled projection of all other balancing flows. In the second part, a variant of generalized diffusion is investigated. Complexity results are formulated and it is shown that this algorithm theoretically converges faster than the hydrodynamic algorithm. Comparative tests between different variants of generalized diffusion algorithms are performed.