An approximation algorithm for scheduling trees of malleable tasks (Q1848358)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1832929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for scheduling trees of malleable tasks |
scientific article; zbMATH DE number 1832929 |
Statements
An approximation algorithm for scheduling trees of malleable tasks (English)
0 references
20 November 2002
0 references
Parallel computing
0 references
Scheduling
0 references
Malleable tasks
0 references
Precedence constraints
0 references
Trees
0 references
0.924386501312256
0 references
0.923309087753296
0 references
0.892251193523407
0 references
