An effective list scheduling algorithm for homogeneous multi-core processor

With increasing of the number of processors, the quantity of data and the communication traffic in multi-core parallel systems, data scheduling becomes an important factor to restrict the performance improvement. Based on the classic list scheduling-HEFT algorithm, an improved algorithm has been proposed in this paper to make better result of reordering the same priority level tasks. The presented algorithm improves the quality of scheduling by introducing the sum of communication time and executing time as a new parameter. The experiment results show that the proposed algorithm has good effect on lists derived from a variety of node priority levels.