On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56171480, #quickstatements; #temporary_batch_1706516978579 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:56, 6 February 2024
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
