Skip to main content
SpringerLink
Log in

Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted to it. We study the problem of scheduling a set of n independent malleable tasks on an arbitrary number m of parallel processors and propose an asymptotic fully polynomial time approximation scheme. For any fixed ε > 0, the algorithm computes a non-preemptive schedule of length at most (1+ε) times the optimum (plus an additive term) and has running time polynomial in n,m and 1 /ε.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut für Informatik und praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Olshausenstrasse 40, 24098 Kiel, Germany

    Klaus Jansen

Authors
  1. Klaus Jansen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Klaus Jansen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jansen, K. Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. Algorithmica 39, 59–81 (2004). https://doi.org/10.1007/s00453-003-1078-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-003-1078-6

Search

Navigation