Please use this identifier to cite or link to this item:
Author(s): Hamid Arabnejad
Jorge Manuel Gomes Barbosa
Title: List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table
Issue Date: 2014
Abstract: Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computingsystems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) forheterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the samepurpose, that is, O(v^2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-aheadfeature without increasing the time complexity associated with computation of an Optimistic Cost Table (OCT). The calculatedvalue is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on anOCT table that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generatedgraphs 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 bestresults.
Subject: Engenharia de computadores, Engenharia electrotécnica, electrónica e informática
Computer engineering, Electrical engineering, Electronic engineering, Information engineering
Scientific areas: Ciências da engenharia e tecnologias::Engenharia electrotécnica, electrónica e informática
Engineering and technology::Electrical engineering, Electronic engineering, Information engineering
Document Type: Artigo em Revista Científica Internacional
Rights: restrictedAccess
Appears in Collections:FEUP - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
  Restricted Access
pdf624.71 kBAdobe PDF    Request a copy from the Author(s)

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.