Real-time uniprocessor scheduling with fewer preemptions (Q682422)
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 6833839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Real-time uniprocessor scheduling with fewer preemptions |
scientific article; zbMATH DE number 6833839 |
Statements
Real-time uniprocessor scheduling with fewer preemptions (English)
0 references
2 February 2018
0 references
fewer preemptions
0 references
EDF (earliest deadline first)
0 references
RM (rate monotonic)
0 references
real-time scheduling
0 references
uniprocessor systems
0 references
0.9327669
0 references
0.92734003
0 references
0.9193163
0 references
0.8986682
0 references
0.8973961
0 references
0.8935611
0 references
0.8915695
0 references
0.89108443
0 references
