Dynamic Load-Balancing with Variable Number of Processors based on Graph Repartitioning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2012

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.
Fichier principal
Vignette du fichier
RR-7926.pdf (504.23 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00687073 , version 1 (12-04-2012)

Identifiers

  • HAL Id : hal-00687073 , version 1

Cite

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⟩
108 View
567 Download

Share

Gmail Facebook X LinkedIn More