Intractability issues in mixed-criticality scheduling (Q5140795)
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 7286768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intractability issues in mixed-criticality scheduling |
scientific article; zbMATH DE number 7286768 |
Statements
16 December 2020
0 references
mixed-criticality scheduling
0 references
speedup factor
0 references
competitive ratio
0 references
approximation ratio
0 references
NP-completeness results
0 references
sporadic tasks
0 references
0 references
0.7786575555801392
0 references
0.7653040885925293
0 references
0.7638450860977173
0 references
0.7501149773597717
0 references
0.7427147626876831
0 references
