A New Algorithm for Scheduling Out-Tree Task Graph
一个调度Out-Tree任务图的新算法

The schedule research of Out-Tree task graphs can effectively solve parallel computation of divide-and-conquer problem. For this kind of task graphs, a new scheduling algorithm was proposed. First new definition for each task was introduced, then the priority of each task based on the definition was computed, the schedule carried on. During scheduling, in order to save processors, the nodes were allocated to the used processors as far as possible without changing the scheduling length. The experiment shows that the proposed algorithm has better scheduling performance than the other algorithms.