Process Placement in Multicore Clusters: Algorithmic Issues and Practical Techniques

Emmanuel Jeannot 1, 2 Guillaume Mercier 1, 2 François Tessier 1, 2
1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
Abstract : Current generations of NUMA node clusters feature multicore or manycore processors. Programming such architectures efficiently is a challenge because numerous hardware characteristics have to be taken into account, especially the memory hierarchy. One appealing idea to improve the performance of parallel applications is to decrease their communication costs by matching the communication pattern to the underlying hardware architecture. In this report, we detail the algorithm and techniques proposed to achieve such a result: first, we gather both the communication pattern information and the hardware details. Then we compute a relevant reordering of the various process ranks of the application. Finally, those new ranks are used to reduce the communication costs of the application.
Type de document :
Article dans une revue
IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2013
Liste complète des métadonnées
https://hal.inria.fr/hal-00921605
Contributeur : François Tessier <>
Soumis le : vendredi 20 décembre 2013 - 16:38:33
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12

Identifiants

  • HAL Id : hal-00921605, version 1

Collections

INRIA | LABRI | UNIV-BORDEAUX | PLAFRIM

Citation

Emmanuel Jeannot, Guillaume Mercier, François Tessier. Process Placement in Multicore Clusters: Algorithmic Issues and Practical Techniques. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 2013. 〈hal-00921605〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

198

Contact


archive-ouverte@inria.fr