| BDCP:一个有效的相关任务调度算法 |
| |
| 引用本文： | 石威,季振洲,方滨兴,胡铭曾.BDCP:一个有效的相关任务调度算法[J].高技术通讯,2000,10(5):68-70,67. |
| |
| 作者姓名： | 石威 季振洲 方滨兴 胡铭曾 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与工程系,哈尔滨,150001 |
| |
| 基金项目： | 国防“九五”预研项目!( 16 6 2 3) |
| |
| 摘 要： | 表调度算法ＢＤＣＰ采用动态关键路径技术并均衡考虑关键路径结点和非关键路径结点，使得对相关任务图调度长度影响最大的就绪得结点能够被优先调度，从而极大地缩短了调度长度。分析和实验结果表明，该算法要明显优于ＭＣＰ和ＥＴＦ算法。
|
| 关 键 词： | 表调度 任务调度 动态关键路径 调度算法 |
BDCP:An Effective Scheduling Algorithm for Dependent Tasks |
| |
| Shi Wei,Ji Zhenzhou,Fang Binxing,Hu Mingzeng.BDCP:An Effective Scheduling Algorithm for Dependent Tasks[J].High Technology Letters,2000,10(5):68-70,67. |
| |
| Authors: | Shi Wei Ji Zhenzhou Fang Binxing Hu Mingzeng |
| |
| Abstract: | Two typical list scheduling algorithms-MCP algorithm and ETF algorithm were analysed and found that they have some weakness. A better list scheduling algorithm-BDCP algorithm was presented. This algorithm adopts dynamic critical path and evenly takes critical nodes and noncritical nodes into consideration, which makes the ready node that has the greatest influence to the scheduling length of dependent task graph be schedule firstly to shorten the scheduling length greatly. The result of analyzing and experimenting show that BDCP algorithm is obviously better than MCP and ETF algorithm. |
| |
| Keywords: | List scheduling Task scheduling Dynamic critical path Scheduling length |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
