.png){kind=icon}
.png){kind=icon}
Return
An enhanced list scheduling algorithm for heterogeneous computing using an optimized Predictive Cost Matrix
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2025.107733.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Effective task scheduling is essential for optimizing resource utilization and improving system performance in heterogeneous computing environments. Current algorithms face challenges, particularly their need for more focus on the computational demands of intensive tasks and their inadequate attention to load balancing during processor allocation. To solve these problems, this study introduces the Balanced Prediction Priority Task Scheduling (BPPTS) algorithm, a novel list scheduling approach to improve the scheduling efficiency of compute-heavy tasks in heterogeneous systems. The BPPTS algorithm proposes the Balanced Prediction Cost Matrix (BPCM), which comprehensively evaluates the importance of tasks by considering their average computation cost. At the same time, a computation enhancement factor is introduced in the priority sorting to optimize the scheduling of computation-intensive tasks. The goal is to improve the scheduling efficiency of computation-intensive tasks and achieve load balancing. The BPPTS algorithm has a complexity of O(v2p), where v represents the number of tasks, and p denotes the number of processors. Experiments demonstrate that BPPTS outperforms other algorithms in terms of maximum completion time and speedup.
Keywords:
Heterogeneous computing
Task scheduling algorithms
List-based scheduling
Computational complexity
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W