Near-Optimal Placement of MPI Processes on Hierarchical NUMA Architectures

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 res...

Full description

Saved in:
Bibliographic Details
Published inEuro-Par 2010 - Parallel Processing pp. 199 - 210
Main Authors Jeannot, Emmanuel, Mercier, Guillaume
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2010
SeriesLecture Notes in Computer Science
Subjects
Communication Pattern
Memory Hierarchy
NUMA Node
Process Placement
Virtual Process
Online AccessGet full text
ISBN9783642152900
3642152902
ISSN0302-9743
1611-3349
1611-3349
DOI10.1007/978-3-642-15291-7_20

Cover

More Information
Summary: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.
ISBN:9783642152900
3642152902
ISSN:0302-9743
1611-3349
1611-3349
DOI:10.1007/978-3-642-15291-7_20