Lower-bound complexity algorithm for task scheduling on heterogeneous grid

The problem of best schedule of dependent-tasks application into nodes of computational grid in low complexity is the most important issue to obtain high performance application execution. Scheduling can be performed at compile-time or at run-time depends on tasks and grid-nodes available informatio...

Ausführliche Beschreibung