Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Computing Année : 2015

Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems

(1, 2) , (2) , (2)
1
2

Résumé

We introduce a new parallelization framework for scientific computing based on BDSC, an efficient automatic scheduling algorithm for parallel programs in the presence of resource constraints on the number of processors and their local memory size. BDSC extends Yang and Gerasoulis's Dominant Sequence Clus-tering (DSC) algorithm; it uses sophisticated cost models and addresses both shared and distributed parallel memory architectures. We describe BDSC, its integration within the PIPS compiler infrastructure and its application to the parallelization of four well-known scientific applications: Harris, ABF, equake and IS. Our experiments suggest that BDSC's focus on efficient resource man-agement leads to significant parallelization speedups on both shared and dis-tributed memory systems, improving upon DSC results, as shown by the com-parison of the sequential and parallelized versions of these four applications running on both OpenMP and MPI frameworks.
Fichier principal
Vignette du fichier
A-499-accepte.pdf (1.08 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01097328 , version 1 (19-12-2014)

Identifiants

Citer

Dounia Khaldi, Pierre Jouvelot, Corinne Ancourt. Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems. Parallel Computing, 2015, 41, pp.66 - 89. ⟨10.1016/j.parco.2014.11.004⟩. ⟨hal-01097328⟩
111 Consultations
210 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More