A Semi-Greedy Heuristic for the Mapping of Large Task Graphs
- 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
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
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
- crossref · retrieved 2026-09-25T22:34:52.148Z