A Near Lower-Bound Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Computing Systems

Gomaa Hagras, T., Janeček, J.

GOMAA HAGRAS, T. and J. JANEČEK. A Near Lower-Bound Complexity Algorithm for Compile-Time Task Scheduling in Heterogeneous Computing Systems. In: Proceedings of 3rd International Symposium on Parallel and Distributed Computing. 3rd International Symposium on Parallel and Distributed Computing, Cork, 2004-07-05/2004-07-07. Los Alamitos: IEEE Computer Society Press, 2004. p. 106-113. ISBN 0-7695-2210-6.