Fast generation of large task network mappings - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Fast generation of large task network mappings

(1) , (2) , (1) , (2)
1
2

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.
Not file

Dates and versions

cea-01839857 , version 1 (16-07-2018)

Identifiers

Cite

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⟩
24 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More