A List Scheduling Algorithm for Heterogeneous Computing Systems Using Improved Predict Cost Matrix for Task Prioritizing br

he improvement of application efficiency of heterogeneous computing systems is highly dependenton effective scheduling algorithms. A new list scheduling algorithm called Improved Predict Priority andOptimistic processor Selection Scheduling (IPPOSS) is proposed by this paper. By introducing the backwardprediction cost of tasks in task prioritizing phase, the scheduling length is reduced. Compared with the existingwork, an Improved Predict Cost Matrix (IPCM) is adopted to prioritize tasks more reasonably and a bettersolution in processor selection phase when keeping quadratic time complexity is obtain. IPCM, which considersvarious calculation and communication factors in the task prioritization stage, is easier to obtain a reasonablepriority list than Predict Cost Matrix (PCM) proposed by Predict Priority Task Scheduling (PPTS). That theperformance of IPPOSS is better than related algorithms is shown by the analysis of the experimental results ofrandomly generated application Directed Acyclic Graphs (DAGs) and real-world application DAGs.