Journal of Software:1999.10(10):1038-1046

Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme
DU Jian-cheng,HUANG Hao,CHEN Dao-xu,XIE Li
Chart / table
Similar Articles
Article :Browse 2343   Download 2564
Received:June 30, 1998    Revised:October 14, 1998
> 中文摘要: 基于最佳并行度的任务依赖图调度策略充分利用编译时刻所得到的全局信息,采用横向和纵向任务合并,处理节点预分配,静态调度和动态调度相结合、集中式调度和分层调度相结合等措施,是一种简单的、具有较高效率的实用化调度方案.该调度方案能够在尽量压缩调度长度的情况下节约系统资源.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:本文研究得到国家863高科技项目基金资助。 本文研究得到国家863高科技项目基金资助。
Foundation items:
Reference text:

杜建成,黄 皓,陈道蓄,谢 立.基于最佳并行度的任务依赖图调度.软件学报,1999,10(10):1038-1046

DU Jian-cheng,HUANG Hao,CHEN Dao-xu,XIE Li.Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme.Journal of Software,1999,10(10):1038-1046