基于最佳并行度的任务依赖图调度

Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme

基于最佳并行度的任务依赖图调度策略充分利用编译时刻所得到的全局信息，采用横向和纵向任务合并，处理节点预分配，静态调度和动态调度相结合、集中式调度和分层调度相结合等措施，是一种简单的、具有较高效率的实用化调度方案．该调度方案能够在尽量压缩调度长度的情况下节约系统资源．

Optimum degree of parallelism-based task dependence graph scheduling scheme fully utilizes theglobal information collected at compile-time, employs the techniques such as task merging in horizontal andvertical directions, processors pre-allocation, combination of static and dynamic scheduling, and integration ofcentralized scheduling and layer-scheduling. It is a simple, practical and effective scheduling method whichaddresses the problem of how to both reduce the execution time of programs and economize on processorresources.