A note on the complexity of scheduling of communication-aware directed acyclic graph - Bulletin of the Polish Academy of Sciences: Technical Sciences - Issue 2 (2018) - PSJD - Yadda

Full-text resources of PSJD and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Journal

Bulletin of the Polish Academy of Sciences: Technical Sciences

2018 | 2 |

Article title

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

Authors

J. Musial , M. Guzek , P. Bouvry , J. Blazewicz

Content

Full texts:

oai-journals-pan-pl-106428/full-text/DOI.pdf

Download

Title variants

Languages of publication

PL

Abstracts

Keywords

PL

computational complexity models in cloud computing communication-aware cloud computing directed acyclic graphs NP-hardness in cloud computing Nauki Techniczne

Publisher

Polska Akademia Nauk

Journal

Bulletin of the Polish Academy of Sciences: Technical Sciences

Year

2018

Issue

2

Physical description

Contributors

author

J. Musial

author

M. Guzek

author

P. Bouvry

author

J. Blazewicz

References

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.oai-journals-pan-pl-106428

JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.