| 本文已被：浏览 3951次 下载 5478次 |
码上扫一扫！ |
|
|
| 基于最佳并行度的任务依赖图调度 |
|
杜建成1,2, 黄 皓1,2, 陈道蓄1,2, 谢 立1,2
|
|
1.南京大学计算机软件新技术国家重点实验室,南京,210093;2.南京大学计算机科学与技术系,南京,210093
|
|
| 摘要: |
| 基于最佳并行度的任务依赖图调度策略充分利用编译时刻所得到的全局信息,采用横向和纵向任务合并,处理节点预分配,静态调度和动态调度相结合、集中式调度和分层调度相结合等措施,是一种简单的、具有较高效率的实用化调度方案.该调度方案能够在尽量压缩调度长度的情况下节约系统资源. |
| 关键词: 层次任务图,任务依赖图,静态调度,动态调度,最佳并行度. |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家863高科技项目基金资助。 |
|
| Optimum Degree of Parallelism-based Task Dependence Graph Scheduling Scheme |
|
DU Jian-cheng,HUANG Hao,CHEN Dao-xu,XIE Li
|
| 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. |
| Key words: Hierarchical task graph, task dependence graph, static scheduling, dynamic scheduling, optimum degree of parallelism. |
