中文摘要：

高效的任务调度算法使多核处理器的资源分配和并行计算能力更加高效。通过研究关键路径对任务调度算法的重要性后提出TDMCP算法。对DAG上关键任务的确定采用一种多关键路径选取的方法，使得关键路径上信息在任务调度的每一步都是实时更新的；保证调度的每一步优先执行紧迫性高的任务；对首任务采用任务复制技术，使得后续任务的调度更加的高效，从整体上提高任务调度效率。和两个经典任务调度算法进行实验性能的比较，比较结果表明TDMCP算法在任务调度时间和算法执行效率方面都要优于两种经典算法。

英文摘要：

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.