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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 25; číslo 3; s. 682 - 694
Hlavní autori:	Arabnejad, Hamid, Barbosa, Jorge G.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.03.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!