A new sufficient schedulability analysis for hybrid scheduling (Q328917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6641886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new sufficient schedulability analysis for hybrid scheduling |
scientific article; zbMATH DE number 6641886 |
Statements
A new sufficient schedulability analysis for hybrid scheduling (English)
0 references
21 October 2016
0 references
scheduling algorithms
0 references
real-time systems
0 references
schedulability analysis
0 references
preemptive scheduling
0 references
earliest deadline first
0 references
fixed priority
0 references
0.7781609296798706
0 references
0.7692386507987976
0 references
0.7680025100708008
0 references
0.7597113847732544
0 references
0.7553203701972961
0 references
