| 一个有效的Join任务图的调度算法 |
| |
| 引用本文： | 蒋卫民,张建军.一个有效的Join任务图的调度算法[J].计算机与数字工程,2011,39(4):34-38. |
| |
| 作者姓名： | 蒋卫民 张建军 |
| |
| 作者单位： | 1. 92351部队,三亚,572016
2. 海军工程大学理学院,武汉,430033 |
| |
| 基金项目： | 海军工程大学自然科学基金项目 |
| |
| 摘 要： | 已有的Join任务图的调度算法大多不是基于通信竞争的环境而开发,且未考虑节省处理机的问题,使算法的应用效果不佳.因此,针对Join任务图,提出一个通信竞争环境的调度算法,该算法因串行通信边而改善其调度效率,时间复杂度为O(vlogv),其中,v为图中任务的个数.实验结果表明,与其他算法相比,该算法的调度长度较短且使用的...
|
| 关 键 词： | 任务调度 Join任务图 通信竞争 关键任务 调度长度 |
An Efficient Scheduling Algorithm for Join Task Graphs |
| |
| Jiang Weimin,Zhang Jianjun.An Efficient Scheduling Algorithm for Join Task Graphs[J].Computer and Digital Engineering,2011,39(4):34-38. |
| |
| Authors: | Jiang Weimin Zhang Jianjun |
| |
| Affiliation: | 2)(No.92351 Troops of PLA1),Sanya 572016)(College of Science,Naval University of Engineering2),Wuhan 430033) |
| |
| Abstract: | Many previous algorithms were not developed under the communication contention environment and neglected to economize the processors in real applications,which led to poor efficiency.Aiming at join task graphs,this paper proposes a communication contention-aware scheduling algorithm,which can improve the scheduling efficiency by serializing the communication edges.The time complexity of the presented algorithm is O（vlogv）,where v is the number of tasks.Simulation results show that the proposed algorithm has shorter scheduling length,less number of processors and higher speedup than other compared algorithms. |
| |
| Keywords: | task scheduling Join task graph communication contention critical task scheduling length |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
