Multi Core Scheduling Algorithm Based on Affinity Node Fusion

List based scheduling algorithm is widely used in the field of multi-core task scheduling because of its low complexity and high efficiency. Classical list scheduling algorithm does not consider the impact of communication overhead between nodes in the node allocation stage, so it is difficult to achieve good results. To solve this problem, this paper proposes a list scheduling (ANF) algorithm based on affinity node fusion. By fusing affinity nodes of nodes in task cluster into task cluster, a better scheduling sequence is generated and better scheduling effect is obtained. Theoretical analysis shows that ANF algorithm can greatly reduce the communication overhead between related tasks and shorten the task completion time.