Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling

Mugurel Ionut Andreica, Nicolae Tapus

Open source

DOI
10.1109/ispdc.2008.36
Published
2008
Container
2008 International Symposium on Parallel and Distributed Computing
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/ispdc.2008.36,
  title = {Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling},
  author = {Mugurel Ionut Andreica and Nicolae Tapus},
  year = {2008},
  journal = {2008 International Symposium on Parallel and Distributed Computing},
  doi = {10.1109/ispdc.2008.36},
  url = {https://doi.org/10.1109/ispdc.2008.36}
}

RIS

TY  - JOUR
TI  - Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling
AU  - Mugurel Ionut Andreica
AU  - Nicolae Tapus
PY  - 2008
JO  - 2008 International Symposium on Parallel and Distributed Computing
DO  - 10.1109/ispdc.2008.36
UR  - https://doi.org/10.1109/ispdc.2008.36
ER  - 

APA

Andreica, M. I., & Tapus, N. (2008). Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling. 2008 International Symposium on Parallel and Distributed Computing. https://doi.org/10.1109/ispdc.2008.36

Source records