%0 Journal Article
%T Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme<br>基于最佳并行度的任务依赖图调度
%A DU Jian-cheng
%A HUANG Hao
%A CHEN Dao-xu
%A XIE Li
%A <br>杜建成
%A 黄皓
%A 陈道蓄
%A 谢立
%J 软件学报
%D 1999
%I 
%X Optimum degree of parallelism-based task dependence graph scheduling scheme fully utilizes the global information collected at compile-time, employs the techniques such as task merging in horizontal and vertical directions, processors pre-allocation, combination of static and dynamic scheduling, and integration of centralized scheduling and layer-scheduling. It is a simple, practical and effective scheduling method which addresses the problem of how to both reduce the execution time of programs and economize on processor resources.
%K Hierarchical task graph
%K task dependence graph
%K static scheduling
%K dynamic scheduling
%K optimum degree of parallelism<br>层次任务图
%K 任务依赖图
%K 静态调度
%K 动态调度
%K 最佳并行度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=8F0F02097BF3FA7C&yid=B914830F5B1D1078&vid=F3090AE9B60B7ED1&iid=F3090AE9B60B7ED1&sid=11924CB7A7AEB526&eid=9A7C41A6BCE530C0&journal_id=1000-9825&journal_name=软件学报&referenced_num=3&reference_num=6