On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458)
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: On the complexity of fixed-priority scheduling of periodic, real-time tasks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of fixed-priority scheduling of periodic, real-time tasks |
scientific article |
Statements
On the complexity of fixed-priority scheduling of periodic, real-time tasks (English)
0 references
1982
0 references
optimal fixed-priority scheduling algorithm
0 references
periodic real-time tasks
0 references
multiprocessors system
0 references
NP-completeness
0 references
computational complexity
0 references
NP- hardness
0 references
