摘要
描述了一种基于有向非循环图（ＤＡＧ）的任务调度算法，该算法将整个计算任务分解成为一个ＤＡＧ图，根据ＤＡＧ图计算出每个子任务的最早开始时间，然后根据每个子任务的最早开始时间和处理机的数量进行调度。该算法可以实现子任务集在ＤＡＧ图限制下的最优调度。
Presents a task scheduling algorithm based on Directed Acyclic Graph (DAG). The whole task is divided into a DAG. The earliest start time of every subtask is calculated according to the DAG. The algorithm schedules the subtasks according to the earliest start time and the amount of processors. Optimal scheduling can be realized in the restriction of DAG in this algorithm.
