Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling
From MaRDI portal
Publication:436216
DOI10.1007/S11241-011-9137-6zbMATH Open1243.68097OpenAlexW2052706221MaRDI QIDQ436216FDOQ436216
Authors: Sanjoy K. Baruah
Publication date: 30 July 2012
Published in: Real-Time Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11241-011-9137-6
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
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
- Approximation techniques for response-time analysis of static-priority tasks
- Rate monotonic vs. EDF: judgment day
Cited In (3)
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)