Description: 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.
File list (Check if you may need any files):
dag_schedule.doc
Download