Tight performance bounds of CP-scheduling on out-trees (Q5952053)
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: Tight performance bounds of CP-scheduling on out-trees |
scientific article; zbMATH DE number 1687627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight performance bounds of CP-scheduling on out-trees |
scientific article; zbMATH DE number 1687627 |
Statements
Tight performance bounds of CP-scheduling on out-trees (English)
0 references
14 August 2002
0 references
multiprocessor scheduling
0 references
scheduling identical processors
0 references
tree-type precedence relations
0 references
worst-case ratio
0 references
release time
0 references
remainder
0 references
0.85154784
0 references
0.85108846
0 references
0.8486693
0 references
0.8472151
0 references
0.84343475
0 references
0.8415597
0 references
0.8372982
0 references
0.83445024
0 references
0.83409375
0 references
