Design and analysis of the M2LL policy distributed algorithm for load balancing in dynamic networks

Authors:
Jacques M. Bahi;Raphaël Couturier;Abderrahmane Sider
Affiliations:
Laboratoire d'Informatique de l'Université de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, Belfort Cedex, France;Laboratoire d'Informatique de l'Université de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, Belfort Cedex, France;Département d'Informatique, Université Abderrahmane Mira de Béjaïa, Algérie
Venue:
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Year:
2006

Citing 9
Cited 1

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
Approximate load balancing on dynamic and asynchronous networks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Strategies for Dynamic Load Balancing on Highly Parallel Computers

IEEE Transactions on Parallel and Distributed Systems
Load Balancing on Networks with Dynamically Changing Topology

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Performance Comparison of Dynamic Load-Balancing Strategies for Distributed Computing

HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Dynamic load balancing by diffusion in heterogeneous systems

Journal of Parallel and Distributed Computing

Fast load balancing with the most to least loaded policy in dynamic networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Load balancing a distributed/parallel system consists in allocating work (load) to its processors so that they all have to process approximately the same amount of work or amounts in relation with their computation power. In this paper, we present a new distributed algorithm that implements the M2LL policy (Most to Least Loaded). M2LL aims to indicate pairs of processors, that will exchange load, taking into account actually broken edges as well as the current load distribution in the system. The M2LL policy fixes the pairs of neighboring processors by selecting with priority the most loaded and the least loaded of each neighborhood. Our main result is that the M2LL distributed implementation terminates after at most (n/2).dt iterations where n and dt are respectively the number of nodes and the degree of the system at time t.