On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (Q255296)
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 compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm |
scientific article; zbMATH DE number 6552372
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm |
scientific article; zbMATH DE number 6552372 |
Statements
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley's optimal priority assignment algorithm (English)
0 references
9 March 2016
0 references
real-time scheduling
0 references
global fixed-priority pre-emptive scheduling
0 references
optimal priority assignment
0 references
exact schedulability tests
0 references
sporadic tasks
0 references
periodic tasks
0 references
0 references
0 references
0.8556110262870789
0 references
0.7925817966461182
0 references
0.790652871131897
0 references
0.7861921787261963
0 references
0.7783684134483337
0 references
