On the complexity of fixed-priority scheduling of periodic, real-time tasks (Q3960458): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-5316(82)90024-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064207294 / rank | |||
Normal rank | |||
Revision as of 19:15, 19 March 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
