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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 25; no. 3; pp. 682 - 694
Main Authors:	Arabnejad, Hamid, Barbosa, Jorge G.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!