Skip to Main content Skip to Navigation
Conference papers

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

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.
Document type :
Conference papers
Complete list of metadata
Contributor : Léna Le Roy Connect in order to contact the contributor
Submitted on : Friday, July 13, 2018 - 10:28:40 AM
Last modification on : Thursday, February 17, 2022 - 10:08:06 AM



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⟩



Record views