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

Abstract : Dynamic load balancing is an important step conditioning the performance of parallel adaptive codes whose load evolution is difficult to predict. Most of the works 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 a variable 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 matrices 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.
Type de document :
[Research Report] RR-7926, INRIA. 2012
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

Contributeur : Aurélien Esnard <>
Soumis le : jeudi 12 avril 2012 - 10:48:49
Dernière modification le : jeudi 11 janvier 2018 - 06:22:35
Document(s) archivé(s) le : lundi 26 novembre 2012 - 13:21:16


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-00687073, version 1



Clément Vuchener, Aurélien Esnard. Dynamic Load-Balancing with Variable Number of Processors based on Graph Repartitioning. [Research Report] RR-7926, INRIA. 2012. 〈hal-00687073〉



Consultations de la notice


Téléchargements de fichiers