MPI-I-98-1-025. November 1998, 15 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:
To download this research report, please select the type of document that fits best your needs. | Attachement Size(s): |
---|---|
236 KBytes | |
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView |