Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors |
scientific article; zbMATH DE number 5544689
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors |
scientific article; zbMATH DE number 5544689 |
Statements
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (English)
0 references
17 April 2009
0 references
complexity
0 references
divide-and-conquer graph
0 references
HLF
0 references
identical parallel processors
0 references
makespan
0 references
0 references
