A semi-greedy heuristic for the mapping of large task graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

A semi-greedy heuristic for the mapping of large task graphs

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

Abstract

In the context of the dataflow process network mapping problem, we propose a parallel solutionmethod based on a semi-greedy heuristic to improve the solution quality of a greedy regret-based mapping algorithm (RBA). In this method, several executions of a randomized version of RBA are performed in parallel togenerate different solutions. We exploit a correlation between solution quality and execution time to propose a methodologyto stop the method after only a small amount of solutions are obtained.
Not file

Dates and versions

cea-01838136 , version 1 (13-07-2018)

Identifiers

Cite

K.-E. Berger, F. Galea, B.L. Cun, R. Sirdey. A semi-greedy heuristic for the mapping of large task graphs. 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), May 2016, Chicago, United States. pp.817-824, ⟨10.1109/IPDPSW.2016.179⟩. ⟨cea-01838136⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More