Fast generation of large task network mappings - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Fast generation of large task network mappings

Résumé

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.
Fichier principal
Vignette du fichier
Berger2014.pdf (119.81 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

cea-01839857 , version 1 (23-10-2023)

Identifiants

Citer

Karl-Eduard Berger, Francois Galea, Bertrand Le Cun, Renaud 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⟩
43 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More