Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (Q436216)
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: Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling |
scientific article; zbMATH DE number 6061827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling |
scientific article; zbMATH DE number 6061827 |
Statements
Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling (English)
0 references
30 July 2012
0 references
constrained-deadline sporadic tasks
0 references
uniprocessor scheduling
0 references
deadline-monotonic
0 references
response-time analysis
0 references
0 references
0.8230708241462708
0 references
0.7780439853668213
0 references
0.7538935542106628
0 references
0.7516016960144043
0 references
0.7511707544326782
0 references
