Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (Q3468873)
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 4135702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints |
scientific article; zbMATH DE number 4135702 |
Statements
Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints (English)
0 references
1989
0 references
tree-like precedence constraints
0 references
two processor scheduling
0 references
schedules for trees
0 references
worst-case absolute error
0 references
0.8757361769676208
0 references
0.8361802101135254
0 references
0.8333876132965088
0 references
