A note on the complexity of scheduling of communication-aware directed acyclic graph
[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee
2018
scientific article
english
- computational complexity
- models in cloud computing
- communication-aware cloud computing
- directed acyclic graphs
- NP-hardness in cloud computing
187 - 191
CC BY-NC-ND (attribution - noncommercial - no derivatives)
open journal
final published version
at the time of publication
25
25
1,277