An approximation algorithm for scheduling trees of malleable tasks (Q1848358): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00264-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993720874 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for scheduling trees of malleable tasks |
scientific article |
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
