Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download

https://hal-mines-paristech.archives-ouvertes.fr/hal-01097328
Contributor : Claire Medrala Connect in order to contact the contributor
Submitted on : Friday, December 19, 2014 - 2:22:07 PM
Last modification on : Monday, May 3, 2021 - 8:44:04 AM
Long-term archiving on: : Monday, March 23, 2015 - 5:52:09 PM

File

A-499-accepte.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

309

Files downloads

456