Skip to Main content Skip to Navigation
Conference papers

Fast generation of large task network mappings

K.-E. Berger 1 F. Galea 2 B. Le Cun 1 R. Sirdey 2 
1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation
2 DACLE-LIST - Département d'Architectures, Conception et Logiciels Embarqués-LIST
Abstract : In the context of networks of massively parallel execution models, optimizing the locality if inter-process communication is a major performance issue. We propose two heuristics to solve a dataflow process network mapping problem, where a network of communicating tasks is placed into a set of processors with limited resource capacities, while minimizing the overall communication bandwidth between processors. Those approaches are designed to tackle instances of over one hundred thousand tasks in acceptable time.
Keywords : Mapping Optimization Parallel processing systems Communicating tasks Communication bandwidth Dataflow process networks Execution optimization Heuristics Interprocess communication Massively parallels Process network mappings Distributed computer systems
Document type :
Conference papers
Complete list of metadata
https://hal-cea.archives-ouvertes.fr/cea-01839857
Contributor : Léna Le Roy Connect in order to contact the contributor
Submitted on : Monday, July 16, 2018 - 10:06:01 AM
Last modification on : Saturday, June 25, 2022 - 9:11:40 PM

Identifiers

Collections

CEA | CNRS | UVSQ | DRT | LIST | DSCIN

Citation

K.-E. Berger, F. Galea, B. Le Cun, R. Sirdey. Fast generation of large task network mappings. 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, May 2014, Phoenix, United States. pp.1526-1530, ⟨10.1109/IPDPSW.2014.170⟩. ⟨cea-01839857⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

22