Optimal parallel processing of random task graphs (Q5939271)
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: Optimal parallel processing of random task graphs |
scientific article; zbMATH DE number 1625459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel processing of random task graphs |
scientific article; zbMATH DE number 1625459 |
Statements
Optimal parallel processing of random task graphs (English)
0 references
27 August 2001
0 references
parallel processing
0 references
precedence constraints
0 references
stochastic scheduling
0 references
random task graph
0 references
makespan
0 references
flowtime
0 references
0 references
0.88113933801651
0 references
0.8368380665779114
0 references
0.8320960998535156
0 references
0.8312562108039856
0 references
0.8263528347015381
0 references
