A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning (Q1268800)
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: A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning |
scientific article; zbMATH DE number 1216787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning |
scientific article; zbMATH DE number 1216787 |
Statements
A heuristic for the maximum processor requirement for scheduling layered task graphs with cloning (English)
0 references
22 March 1999
0 references
optimally scheduling
0 references
0.89423954
0 references
0.8691913
0 references
0.8684746
0 references
0.8677822
0 references
0.8649601
0 references
0.85762763
0 references
