文件名称:dag_schedule
介绍说明－－下载内容均来自于网络，请自行研究使用
Compaction of Schedules and a Two-Stage
Approach for Duplication-Based
DAG Scheduling
” DAG scheduling algorithms generate schedules that require prohibitively large number of processors. To address this problem, we propose a generic algorithm, SC, to minimize the processor requirement of any given valid schedule. SC preserves the schedule length of the original schedule and reduces processor count by merging processor schedules and removing redundant duplicate tasks.
Approach for Duplication-Based
DAG Scheduling
” DAG scheduling algorithms generate schedules that require prohibitively large number of processors. To address this problem, we propose a generic algorithm, SC, to minimize the processor requirement of any given valid schedule. SC preserves the schedule length of the original schedule and reduces processor count by merging processor schedules and removing redundant duplicate tasks.
相关搜索： DAG
(系统自动生成,下载前可以参看下载内容)
下载文件列表
dag_schedule.doc