@inproceedings{berger:cea-01838136, TITLE = {{A semi-greedy heuristic for the mapping of large task graphs}}, AUTHOR = {Berger, K.-E. and Galea, F. and Cun, B.L. and Sirdey, R.}, URL = {https://cea.hal.science/cea-01838136}, NOTE = {Conference of 30th IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2016 ; Conference Date: 23 May 2016 Through 27 May 2016; Conference Code:122812}, BOOKTITLE = {{2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}}, ADDRESS = {Chicago, United States}, PUBLISHER = {{Institute of Electrical and Electronics Engineers Inc.}}, PAGES = {817-824}, YEAR = {2016}, MONTH = May, DOI = {10.1109/IPDPSW.2016.179}, KEYWORDS = {Conformal mapping ; Mapping ; Dataflow process networks ; Greedy heuristics ; Mapping algorithms ; Parallel heuristics ; Process network mappings ; Runtime optimization ; Solution quality ; Task graph ; Distributed computer systems}, HAL_ID = {cea-01838136}, HAL_VERSION = {v1}, }