Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling

Many 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 reduc...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on parallel and distributed systems Vol. 20; no. 6; pp. 857 - 871
Main Authors:	Bozdag, D., Ozguner, F., Catalyurek, U.V.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Compaction Complexity Costs Database systems Employment Image processing Merging Multiprocessing systems multiprocessor systems Partitioning algorithms Processor scheduling Processors Reproduction Schedules Scheduling Scheduling algorithm Scheduling algorithms Scheduling and task partitioning Studies task duplication Tasks
ISSN:	1045-9219, 1558-2183
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!