MPI-I-98-1-025

Linear-time approximation schemes for scheduling malleable parallel tasks

Jansen, Klaus and Porkolab, Lorant

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

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-1-025

BibTeX
@TECHREPORT{JansenPorkolab98-1-025, AUTHOR = {Jansen, Klaus and Porkolab, Lorant}, TITLE = {Linear-time approximation schemes for scheduling malleable parallel tasks}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-98-1-025}, MONTH = {November}, YEAR = {1998}, ISSN = {0946-011X},}