Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
From MaRDI portal
(Redirected from Publication:436216)
Recommendations
- Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
- Approximation techniques for response-time analysis of static-priority tasks
- Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
- Rate monotonic scheduling re-analysed
- Utilization bounds for multiprocessor rate-monotonic scheduling
Cites work
- A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
- Approximation techniques for response-time analysis of static-priority tasks
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Rate monotonic vs. EDF: judgment day
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Cited in
(6)- Approximation techniques for response-time analysis of static-priority tasks
- Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
- Improved response-time bounds in fixed priority scheduling with arbitrary deadlines
- Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks
- A residual service curve of rate-latency server used by sporadic flows computable in quadratic time for network calculus
- Minimizing cache usage with fixed-priority and earliest deadline first scheduling
This page was built for publication: Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436216)
