Tight performance bounds of CP-scheduling on out-trees (Q5952053): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1011676725533 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1545223568 / rank | |||
Normal rank | |||
Latest revision as of 10:17, 30 July 2024
scientific article; zbMATH DE number 1687627
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
