Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors

The problem of scheduling a set of n unit execution time (UET) tasks subject to precedence constraints on m identical parallel processors is known to be N P -hard in the strong sense. However, polynomial time algorithms exist for some classes of precedence graphs. In this paper, we consider a class...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete optimization Ročník 6; číslo 1; s. 79 - 91
Hlavní autori:	Kubiak, Wieslaw, Rebaine, Djamal, Potts, Chris
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2009
Predmet:	Complexity Divide-and-conquer graph HLF Identical parallel processors Makespan Divide-and-conquer graph Makespan HLF Complexity Identical parallel processors
ISSN:	1572-5286, 1873-636X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!