DAG任务图的一种调度算法  

A Scheduling Algorithm for DAG Task Graphs

作　　者：蒋廷耀[1] 李庆华[1] 

机构地区：[1]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《小型微型计算机系统》2003年第10期1796-1799,共4页Journal of Chinese Computer Systems

基　　金：国家 8 63项目 (863 -3 0 6-ZD-0 1-7)资助

摘　　要：并行程序的调度技术是开发并行计算机系统的计算潜能的关键问题 .本文讨论了 4种典型的调度算法的缺陷 ,提出了一种新的调度算法 CPFMBF,它采用的策略是 :优先调度关键路径节点 ,其次调度 b_ level值大的节点 ,再次调度节点的关键路径影响度大的节点 .对照分析及在几种具代表性的工程应用任务图上的实验结果证明the scheduling of parallel programs is the key to develop computing power of parallel computer systems. In this paper, drawbacks of four typical scheduling algorithms are discussed and a new algorithm called as CPFMBF is presented. It firstly schedules critical path node. Secondly it schedules the node whose b -level is the largest. Finally it considers the node that the degree that it influences the critical path node is the largest. Comparison analysis and experiment results show the performance of CPFMBF is higher than other four scheduling algorithms.

关 键 词：任务图 算法 并行调度 DAG 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]