摘要
任务调度的优劣是决定并行分布式计算机系统性能好坏的重要因素之一。为优化任务调度,基于一些典型算法(如LG、PPA算法等),提出了一种新的任务调度算法。该算法一方面复制满足条件的前驱任务来缩短调度长度;另一方面合理地复制其他前驱任务和合并冗余簇来减少所需处理器的数目。实验表明,该算法在调度长度和所需处理器的数目上优于以上典型算法,并具有更小的时间复杂度,对并行计算机系统性能的提升具有一定的意义。
The effect of task scheduling is one of the important factors which decide the performance of the parallel distributed computer system. In order to optimize the task scheduling, this paper proposed a novel algorithm based on some typical algorithms （ e. g. LG, PPA algorithm etc. ）. On the one hand, the algorithm replicated precursor tasks which meet the duplication conditions in order to shorten the scheduling length. On the other hand, the algorithm replicated other precursor tasks and merged redundant clusters to reduce the number of the required processors. Simulation results show that the proposed algorithm＇ s performance on scheduling length and the number of the required processors is better than the above typical algorithms＇. Furthermore, the proposed algorithm has a smaller time complexity and benefits the performance of the parallel distributed computer system.
出处
《计算机应用研究》
CSCD
北大核心
2012年第8期2931-2934,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(60973030)
关键词
任务复制
任务调度
多处理器
分簇复制
task duplication
task scheduling
muhi-processor
clustering and duplication
