Improved Priority List Task Scheduling Algorithm

Task scheduling on heterogeneous multiprocessor is an important problem in the field of high performance computing.The paper proposed an improved priority list task scheduling algorithm to solve the problem that misconduct priority method exists in the task scheduling algorithm and the scheduling result is unsatisfactory.The algorithm improves the traditional priority list of task scheduling method which takes average execution time as parameter to calculate priority of task and proposes a weighted priority method to order the priority of tasks based on heterogeneous multi-core performance difference and dependent task characteristics.And then,the paper proposed a new way to select processor core for task which takes the current situation and backward critical path execution time as weight and overcame the local optimal problem brought by greedy though.Furthermore,at the task allocation stage,the algorithm takes task duplication and interval insertion technique to optimize schedule process and shorten the task earliest start time and improve the processor utilization successfully.The instance analysis and simulation experiments prove the algorithm can reduce the execution time of tasks effectively and give a full play to heterogeneous multi-core processor advantage.