HAL : hal-00722731, version 2

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

HIPC 2012, Pune : Inde (2012)

Versions disponibles :

v1 (03-08-2012)

v2 (21-08-2012)

Dynamic Load-Balancing with Variable Number of Processors based on Graph Repartitioning

Clément Vuchener 1, 2, Aurélien Esnard 1, 2

plafrim Collaboration(s)

(2012)

Dynamic load balancing is an important step conditioning the performance of parallel adaptive codes whose load evolution is difficult to predict. Most of the studies which answer this problem perform well, but are limited to an initially fixed number of processors which is not modified at runtime. These approaches can be very inefficient, especially in terms of resource consumption. In this paper, we present a new graph repartitioning algorithm which accepts to dynamically change the number of processors, assuming the load is already balanced. Our algorithm minimizes both data communication and data migration overheads, while maintaining the computational load balanced. This algorithm is based on a theoretical result, that constructs optimal communication patterns with both a minimum migration volume and a minimum number of communications. An experimental study which compares our work against state-of-the-art approaches is presented.

1 :	Laboratoire Bordelais de Recherche en Informatique (LaBRI)
	CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II
2 :	HiePACS (INRIA Bordeaux - Sud-Ouest)
	INRIA – Université de Bordeaux – CNRS : UMR5800 – CERFACS

Domaine

:

Informatique/Calcul parallèle, distribué et partagé

hal-00722731, version 2

http://hal.archives-ouvertes.fr/hal-00722731

oai:hal.archives-ouvertes.fr:hal-00722731

Contributeur : Aurélien Esnard <>

Soumis le : Mardi 21 Août 2012, 12:20:47

Dernière modification le : Lundi 22 Avril 2013, 14:50:18