A scheduling algorithm for heterogeneous computing systems by edge cover queue

In heterogeneous computing systems, excellent task scheduling algorithms can shorten the task completion time and improve system parallelism. With the large-scale deployment of edge computing, the task scheduling algorithm in heterogeneous edge computing servers has become a critical factor in improving the overall system performance. This paper proposes a new task scheduling algorithm called the edge cover scheduling algorithm (ECSA), which schedules tasks based on the edge cover queue of the directed acyclic graph (DAG) for heterogeneous computing systems. Based on the estimation of distribution algorithm (EDA) and the graph random walk algorithm, the ECSA generates an edge cover queue from DAG. Then, the ECSA uses the heuristics greedy method with low time and computational complexity to allocate the edge cover queue to processors. Theoretical analysis and simulation results on random DAGs and real-world DAGs show that the ECSA can achieve better scheduling results in terms of makespan, the schedule length ratio (SLR), efficiency, and frequency of best results with low time and computational complexity.