A note on the complexity of scheduling of communication-aware directed acyclic graph.
Autor: | MUSIAL, J.1 Jedrzej.Musial@cs.put.poznan.pl, GUZEK, M.2, BOUVRY, P.2, BLAZEWICZ, J.1,3 |
---|---|
Zdroj: | Bulletin of the Polish Academy of Sciences: Technical Sciences. 2018, Vol. 66 Issue 2, p187-191. 5p. |
Databáze: | Academic Search Ultimate |
Externí odkaz: |