Skip to Main content Skip to Navigation

Process Mapping onto Complex Architectures and Partitions Thereof

Abstract : Data locality is a critical issue in order to achieve performance on today's high-end parallel machines. As these machines are highly non-uniform, distributing computations across their processing elements does not only require to minimize inter-process communication, but also to favor local communication over distant communication. For that purpose, static and/or dynamic (re)mapping tools have been devised, that allow one to map process graphs onto architecture graphs describing the topology and architectural features of such machines. However, in practice, the real problem to solve is to map a process graph onto possibly disconnected parts of a non-uniform parallel machine, such as a set of nodes provided by some batch scheduler. This paper presents a set of algorithms to perform this task in an efficient way. Efficiency is achieved thanks to a multilevel description of target architectures. All the presented algorithms have been implemented in the \scotch\ static mapping software. Experiments evidence the quality of the produced mappings.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : François Pellegrini Connect in order to contact the contributor
Submitted on : Wednesday, March 7, 2018 - 6:39:40 AM
Last modification on : Friday, January 21, 2022 - 3:10:02 AM
Long-term archiving on: : Friday, June 8, 2018 - 12:37:21 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NoDerivatives 4.0 International License


  • HAL Id : hal-01671156, version 2



François Pellegrini, Cédric Lachat. Process Mapping onto Complex Architectures and Partitions Thereof. [Research Report] RR-9135, Inria Bordeaux Sud-Ouest. 2017, pp.16. ⟨hal-01671156v2⟩



Les métriques sont temporairement indisponibles