Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints

Anne Benoit, Johannes Langguth, Bora Ucar

Open source

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

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