List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

• Type: Article in International Scientific Journal
• Date: 2014

Authors

Hamid Arabnejad (Author) FEUP; Jorge Manuel Gomes Barbosa (Author) FEUP

Journal

Title: IEEE Transactions on Parallel and Distributed Systems

Vol. 25 No. 3

Pages: 682-694

ISSN: 1045-9219

Publisher: IEEE

Indexing

ISI Web of Science

Scopus

COMPENDEX

INSPEC

Scientific classification

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

CORDIS: Technological sciences > Engineering > Computer engineering

Other information

DOI: 10.1109/TPDS.2013.57

Abstract (EN): 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 time complexity as the state-of-the-art algorithm for the same purpose, that is, O(v^2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an Optimistic Cost Table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT table that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency and frequency of best results.

Language: English

Type (Professor's evaluation): Scientific