Abstract:

The list-based task scheduling algorithm has been widely used in the field of task scheduling. The classic list scheduling algorithm randomly sorts the task nodes with the same weight in the node sorting stage. But the sorting method is rough and difficult to achieve better results. In view of this defect, this study proposed an improved list scheduling algorithm. This algorithm integrated tasks with consistent weights through special list fragments, and traversed the scheduling solution space of special list fragments to iteratively generate better scheduling lists to obtain a better scheduling results. The results of random DAG graph test showed that the proposed algorithm had excellent scheduling effect, and the average algorithm enhancement ratio was up to 15.3%, indicating the proposed method was not only suitable for multiple task map scales, but also had better scheduling performance under the condition of higher CCR and higher average access.

Key words: scheduling algorithm, sort nodes, task weigh, weighted consistent ordering dilemma, special list fragment, scheduling space