Task scheduling algorithm of multi critical path based on task duplication

Efficient task scheduling algorithm makes the resource allocation and the parallel computing capabilities of the Multicore processors more efficient.By studying the critical path of the importance to the task scheduling algorithm proposed the TDMCP algorithm.Using a multi critical path method that identified the critical path of the DAG.By this way each step in the task scheduling the information on the critical path is real-time update.It is ensured that every step of the scheduling,the urgency of the task of high priority is executed.At the same time the first task uses task duplication technology making subsequent task scheduling more efficient.To increase efficiency of task scheduling from the overall.Through task scheduling algorithm and two classical experimental performance comparison.The results show that in the task scheduling algorithm execution time and efficiency the TDMCP is better than the two classical algorithms.