Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme
DU Jian-chen · 1999
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.