Scheduling and Task Allocation

After a computational job is designed and realized as a set of tasks, an optimal assignment of these tasks to the processing elements in a given architecture needs to be determined. This problem is called the scheduling problem and known to be one of the most challenging problems in parallel and dis...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advanced Computer Architecture and Parallel Processing S. 235 - 265
Hauptverfasser:	El‐Rewini, Hesham, Abd‐El‐Barr, Mostafa
Format:	Buchkapitel
Sprache:	Englisch
Veröffentlicht:	Hoboken, NJ, USA John Wiley & Sons, Inc 17.12.2004
Schriftenreihe:	Wiley Series on Parallel and Distributed Computing
Schlagworte:	communication models heuristic algorithms for task scheduling NP‐completeness task scheduling task allocation heuristics task allocation models task scheduling task scheduling in heterogeneous environments task scheduling models task scheduling using DAGs
ISBN:	9780471467403, 0471467405
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!