计算机工程与应用Issue(12)：31-37,7.DOI:10.3778/j.issn.1002-8331.1307-0411
一种改进的基于任务复制的多核调度算法
Improved multi-processor scheduling algorithm based on tasks duplication
摘要
Abstract
In the multi-processor system, task scheduling is one of the key factors which decide the performance of system. In order to optimize the task scheduling, this paper proposes a new task scheduling algorithm based on some typical algo-rithms(e.g., PPA, the algorithm which is put forward by XU Cheng etc.). On the one hand, the algorithm establishes reason-able order to duplicate precursor task, and two stages of replication, which can duplicate more precursor task to reduce scheduling length and spare time. On the other hand, the algorithm removes redundant clusters which don’t affect the sched-uling length of the task system, then carries on the merger between clusters to reduce the number of the processor and scheduling length. Simulation results show that the improved algorithm on the performance of task scheduling is superior to the above typical algorithms.关键词
多核/任务复制/任务调度/簇合并Key words
multi-processor/task duplication/task scheduling/merger of clusters分类
信息技术与安全科学引用本文复制引用
叶佳,周鸣争..一种改进的基于任务复制的多核调度算法[J].计算机工程与应用,2015,(12):31-37,7.基金项目
安徽省自然科学基金（No.1308085MF88）；国家自然科学基金（No.61300170）；安徽省教育厅自然科学基金（No.KJ2013A040）。 （）
