{\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling (Q436211)
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: {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling |
scientific article; zbMATH DE number 6061823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | {\textsc{DP-Fair}}: a unifying theory for optimal hard real-time multiprocessor scheduling |
scientific article; zbMATH DE number 6061823 |
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
0.849376380443573
0 references
0.7955038547515869
0 references
0.7907998561859131
0 references
0.7897849082946777
0 references
0.7879045009613037
0 references
