ausblenden:
Schlagwörter:
-
Zusammenfassung:
A malleable parallel task is one whose execution time is a function of the
number of (identical) processors alloted to it. We study the problem of
scheduling a set of $n$ independent malleable tasks on a fixed number of
parallel processors, and propose an approximation scheme that for any fixed
$\epsilon > 0$, computes in $O(n)$ time a non-preemptive schedule of length
at most $(1+\epsilon)$ times the optimum.
