Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (Q326990)
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: Maintaining the feasibility of hard real-time systems with a reduced number of priority levels |
scientific article; zbMATH DE number 6638056
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maintaining the feasibility of hard real-time systems with a reduced number of priority levels |
scientific article; zbMATH DE number 6638056 |
Statements
Maintaining the feasibility of hard real-time systems with a reduced number of priority levels (English)
0 references
13 October 2016
0 references
real-time systems
0 references
feasibility analysis
0 references
fixed-priority scheduling
0 references
rate monotonic algorithm
0 references
online scheduling
0 references
0 references
