Research on Task Allocation Strategy and Scheduling Algorithm of Multi-core Load Balance

Based on the research of multi-core load balancing´s task scheduling and allocation, we proposed the static task graphs stratification algorithm, the static task group scheduling algorithm, and the minimum dynamic link algorithm, aiming at the characteristics of multi-core processors. When these algorithms allocate tasks, they are expected to complete multi-core load balancing. Firstly, the task allocation is divided into two stages: It needs to break dependencies among tasks and relatively independent tasks will be in the same group at the first stage. It conducts static allocation for the principle of load balancing and it allocates initial tasks which have almost the same time for the system hardware threads in the second stage. It allocates tasks which come from system´s running for each hard ware thread with processor´s speed as a standard in the third stage. From the verification of simulation experiment, the algorithms can achieve better load balancing and minimum completion time.