Runtime parallel incremental scheduling of DAGs

被引：7

作者：

Wu, MY ^{[1
]}

Shu, W ^{[1
]}

Chen, Y ^{[1
]}

机构：

[1] Univ New Mexico, Albuquerque, NM 87131 USA

来源：

2000 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/ICPP.2000.876171

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A runtime parallel incremental DAG scheduling approach is described in this paper A DAG is expanded incrementally: scheduled, and executed on a parallel machine. A DAG scheduling algorithm is parallelized to scale to large systems. In this approach, a large DAG can be executed without consuming large amount of memory space. Inaccurate estimation of task execution time and communication time can be tolerated. This runtime approach can also execute dynamic DAGs. Implementation of this parallel incremental system demonstrates the feasibility of this approach. Preliminary results show that it is superior to other approaches.

引用

页码：541 / 548

页数：8

共 14 条

[1]

Ahmad I., 1995, 2 AUSTR C PAR REAL T, P185

[2] Compact DAG representation and its dynamic scheduling [J].