Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling

DOI10.1007/S11241-011-9137-6zbMath1243.68097OpenAlexW2052706221MaRDI QIDQ436216

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

zbMATH Keywords

constrained-deadline sporadic tasksdeadline-monotonicresponse-time analysisuniprocessor scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Improved response-time bounds in fixed priority scheduling with arbitrary deadlines

Cites Work

• Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
• Approximation techniques for response-time analysis of static-priority tasks
• Rate monotonic vs. EDF: judgment day
• On the complexity of fixed-priority scheduling of periodic, real-time tasks
• A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling