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

Tarek Hagras, Jan Janecek

Browse the full ISPDC paper archive.