@techreport{JansenPorkolab98-1-025,
TITLE = {Linear-time approximation schemes for scheduling malleable parallel tasks},
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
LANGUAGE = {eng},
NUMBER = {MPI-I-1998-1-025},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Saarbr{\"u}cken},
YEAR = {1998},
DATE = {1998},
ABSTRACT = {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.},
TYPE = {Research Report / Max-Planck-Institut für Informatik},
}