An effective approximation algorithm for the malleable parallel task scheduling problem (Q433456)
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: An effective approximation algorithm for the malleable parallel task scheduling problem |
scientific article; zbMATH DE number 6055997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective approximation algorithm for the malleable parallel task scheduling problem |
scientific article; zbMATH DE number 6055997 |
Statements
An effective approximation algorithm for the malleable parallel task scheduling problem (English)
0 references
13 July 2012
0 references
scheduling algorithm
0 references
approximation algorithm
0 references
parallel computing
0 references
0 references
0 references
0 references
0 references
0.869929850101471
0 references
0.8522807955741882
0 references
0.8492854833602905
0 references
