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