Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan

The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2004-07, Vol.129 (1-4), p.65-80
Hauptverfasser:	Błażewicz, Jacek, Machowiak, Maciej, Węglarz, Jan, Kovalyov, Mikhail Y., Trystram, Denis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation General circulation models Job shops Ocean circulation Operations research Parallel processing Processing speed Resource allocation Scheduling Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!