{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S11241-011-9130-0 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11241-011-9130-0 / rank | |||
Normal rank | |||
Latest revision as of 17:32, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling |
scientific article |
Statements
{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (English)
0 references
30 July 2012
0 references
real-time scheduling
0 references
multiprocessor scheduling
0 references
sporadic tasks
0 references
constrained deadlines
0 references
fair scheduling
0 references
