Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2008.09.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2008.09.001 / rank | |||
Normal rank | |||
Latest revision as of 12:49, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors |
scientific article |
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
