English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Linear-time approximation schemes for scheduling malleable parallel tasks

Jansen, K., & Porkolab, L.(1998). Linear-time approximation schemes for scheduling malleable parallel tasks (MPI-I-1998-1-025). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-7B6C-D Version Permalink: https://hdl.handle.net/21.11116/0000-0001-7539-C
Genre: Report

Files

show Files
hide Files
:
MPI-I-98-1-025.pdf (Any fulltext), 237KB
View   Save
File Permalink:
https://hdl.handle.net/21.11116/0000-0001-753A-B
Name:
MPI-I-98-1-025.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Jansen, Klaus1, Author           
Porkolab, Lorant1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 1998
 Publication Status: Issued
 Pages: 15 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-1998-1-025
BibTex Citekey: JansenPorkolab98-1-025
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -