Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints
- DOI
- 10.1109/ipdpsw.2013.30
- Published
- 2013-05
- Container
- 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum
- 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.2013.30,
title = {Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints},
author = {Anne Benoit and Johannes Langguth and Bora Ucar},
year = {2013},
journal = {2013 IEEE International Symposium on Parallel \& Distributed Processing, Workshops and Phd Forum},
doi = {10.1109/ipdpsw.2013.30},
url = {https://doi.org/10.1109/ipdpsw.2013.30}
}RIS
TY - JOUR TI - Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints AU - Anne Benoit AU - Johannes Langguth AU - Bora Ucar PY - 2013 JO - 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum DO - 10.1109/ipdpsw.2013.30 UR - https://doi.org/10.1109/ipdpsw.2013.30 ER -
APA
Benoit, A., Langguth, J., & Ucar, B. (2013). Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints. 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum. https://doi.org/10.1109/ipdpsw.2013.30
Source records
- crossref · retrieved 2026-09-25T17:42:18.078Z