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.
Document type :
Reports
[Research Report] RR-7926, INRIA. 2012
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00687073
Contributor : Aurélien Esnard <>
Submitted on : Thursday, April 12, 2012 - 10:48:49 AM
Last modification on : Thursday, January 11, 2018 - 6:22:35 AM
Document(s) archivé(s) le : Monday, November 26, 2012 - 1:21:16 PM

File

RR-7926.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00687073, version 1

Citation

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〉

Share

Metrics

Record views

253

Files downloads

975