List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same ti...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 25; H. 3; S. 682 - 694
Hauptverfasser:	Arabnejad, Hamid, Barbosa, Jorge G.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Application scheduling Computation DAG scheduling Graphs Heuristic algorithms Processors Program processors random graphs generator Schedules Scheduling Scheduling algorithms State of the art static scheduling Tables (data) Tasks Time complexity
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!