A Semi-Greedy Heuristic for the Mapping of Large Task Graphs

Karl-Eduard Berger, Francois Galea, Bertrand Le Cun, Renaud Sirdey

Open source

DOI
10.1109/ipdpsw.2016.179
Published
2016-05
Container
2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
Publisher
IEEE
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1109/ipdpsw.2016.179,
  title = {A Semi-Greedy Heuristic for the Mapping of Large Task Graphs},
  author = {Karl-Eduard Berger and Francois Galea and Bertrand Le Cun and Renaud Sirdey},
  year = {2016},
  journal = {2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
  doi = {10.1109/ipdpsw.2016.179},
  url = {https://doi.org/10.1109/ipdpsw.2016.179}
}

RIS

TY  - JOUR
TI  - A Semi-Greedy Heuristic for the Mapping of Large Task Graphs
AU  - Karl-Eduard Berger
AU  - Francois Galea
AU  - Bertrand Le Cun
AU  - Renaud Sirdey
PY  - 2016
JO  - 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
DO  - 10.1109/ipdpsw.2016.179
UR  - https://doi.org/10.1109/ipdpsw.2016.179
ER  - 

APA

Berger, K., Galea, F., Cun, B. L., & Sirdey, R. (2016). A Semi-Greedy Heuristic for the Mapping of Large Task Graphs. 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). https://doi.org/10.1109/ipdpsw.2016.179

Source records