Process Mapping onto Complex Architectures and Partitions Thereof

Abstract : The Scotch software computes process-processor mappings by assigning recursively parts of the process graphs to parts of the target graphs. To date, while regular target architectures can be described using pre-coded routines, irregular architectures or parts of regular ones require O(P^2) data structures, which makes them unpractical for very big machines. We will present a new, multilevel description of target architectures that alleviates this problem, trading-off memory for run time.
Complete list of metadatas

https://hal.inria.fr/hal-01253509
Contributor : François Pellegrini <>
Submitted on : Wednesday, February 7, 2018 - 6:07:36 PM
Last modification on : Tuesday, October 23, 2018 - 5:24:03 PM
Long-term archiving on : Thursday, May 3, 2018 - 4:18:02 PM

File

presentation (1).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01253509, version 1

Citation

François Pellegrini, Cédric Lachat. Process Mapping onto Complex Architectures and Partitions Thereof. SIAM Conference on Computational Science & Engineering, SIAM, Mar 2015, Salt Lake City, United States. ⟨hal-01253509⟩

Share

Metrics

Record views

232

Files downloads

32