一种多处理机任务分配的启发式算法  

A Heuristic Algorithm for Task Allocation on Distributed Multiprocessor Systems

作　　者：冯斌[1] 孙俊[1] 

机构地区：[1]江南大学信息工程学院,无锡214036

出　　处：《计算机工程》2004年第14期63-65,157,共4页Computer Engineering

摘　　要：列表调度方法与其它方法相比,可以用较少的开销获得更好的结果。但仅用于处理机个数有限的系统,对于处理机个数无限的系统,调度策略都是基于任务簇调度的。文章提出了一种处理机个数无限的任务分配的列表调度算法,称之为节点迁移调度算法(NTSA)。实验证明,该算法解的性能优于其它的算法。List scheduling can produce more satisfactory solutions at significantly lower cost than other approaches. But it is only used for a bounded number of processors. As for the processors with unlimited number, the mapping strategy is based on cluster scheduling. This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node- transferring scheduling algorithm (NTSA). The experiment results show it outperforms other algorithms of the same problem in solution quality.

关 键 词：任务图 任务调度 任务分配 多处理机 关键路径 节点迁移 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]