BDCP:一个有效的相关任务调度算法

BDCP:An Effective Scheduling Algorithm for Dependent Tasks

表调度算法BDCP采用动态关键路径技术并均衡考虑关键路径结点和非关键路径结点 ,使得对相关任务图调度长度影响最大的就绪结点能够被优先调度 ,从而极大地缩短了调度长度。分析和实验结果表明 ,该算法要明显优于MCP和ETF算法。

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.