Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary (Q4984669)
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: Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary |
scientific article; zbMATH DE number 7339110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling algorithm for mixed-criticality jobs based on dynamical demand boundary |
scientific article; zbMATH DE number 7339110 |
Statements
26 April 2021
0 references
mixed-criticality
0 references
criticality switch
0 references
real-time scheduling
0 references
demand boundary function
0 references
slack time
0 references
0.8129527568817139
0 references
0.7937188148498535
0 references
0.7819576859474182
0 references
0.7704973220825195
0 references
0.7699474692344666
0 references
