Linear-time approximation schemes for scheduling malleable parallel tasks

Jansen, Klaus; Porkolab, Lorant

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1819439_4

詳細要約

公開

報告書

Linear-time approximation schemes for scheduling malleable parallel tasks

MPS-Authors

/persons/resource/persons44695

Jansen, Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45212

Porkolab, Lorant
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

1998-1-025
(全文テキスト（全般）), 10KB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-7B6C-D

要旨

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.