Skip to Main content Skip to Navigation
Conference papers

Near-Optimal Placement of MPI processes on Hierarchical NUMA Architectures

Emmanuel Jeannot 1, 2 Guillaume Mercier 1, 2 
1 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : MPI process placement can play a deterministic role concerning the application performance. This is especially true with nowadays architecture (heterogenous, multicore with different level of caches, etc.). In this paper, we will describe a novel algorithm called TreeMatch that maps processes to resources in order to reduce the communication cost of the whole application. We have implemented this algorithm and will discuss its performance using simulation and on the NAS benchmarks.
Complete list of metadata

https://hal.inria.fr/inria-00544346
Contributor : Guillaume Mercier Connect in order to contact the contributor
Submitted on : Thursday, December 9, 2010 - 11:48:16 AM
Last modification on : Saturday, June 25, 2022 - 7:41:17 PM
Long-term archiving on: : Monday, November 5, 2012 - 12:36:06 PM

File

europar10.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Emmanuel Jeannot, Guillaume Mercier. Near-Optimal Placement of MPI processes on Hierarchical NUMA Architectures. Europar, Aug 2010, Ischia, Italy. pp.199-210, ⟨10.1007/978-3-642-15291-7_20⟩. ⟨inria-00544346⟩

Share

Metrics

Record views

158

Files downloads

245