Processing may take a few seconds...

Article


Title

A note on the complexity of scheduling of communication-aware directed acyclic graph

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2018

Published in

Bulletin of the Polish Academy of Sciences. Technical Sciences

Journal year: 2018 | Journal volume: vol. 66 | Journal number: no. 2

Article type

scientific article

Publication language

english

Keywords
EN
  • computational complexity
  • models in cloud computing
  • communication-aware cloud computing
  • directed acyclic graphs
  • NP-hardness in cloud computing
Pages (from - to)

187 - 191

DOI

10.24425/122099

License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Points of MNiSW / journal

25.0

Points of MNiSW / journal in years 2017-2021

25.0

Impact Factor

1.277

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.