Near-optimal placement of MPI processes on hierarchical NUMA architectures

  • Jeannot E
  • Mercier G
  • 28


    Mendeley users who have this article in their library.
  • 40


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Emmanuel Jeannot

  • Guillaume Mercier

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free