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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on parallel and distributed systems Ročník 20; číslo 6; s. 857 - 871
Hlavní autori:	Bozdag, D., Ozguner, F., Catalyurek, U.V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.06.2009 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!