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

Authors:
Sanjoy Baruah
Affiliations:
The University of North Carolina, Chapel Hill, USA
Venue:
Real-Time Systems
Year:
2011

Citing 12
Cited 0

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Rate Monotonic Analysis: The Hyperbolic Bound

IEEE Transactions on Computers
Rate monotonic vs. EDF: judgment day

Real-Time Systems
A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Sustainable Scheduling Analysis

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Response Time Upper Bounds for Fixed Priority Real-Time Systems

RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines

IEEE Transactions on Computers
Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems
Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Real-Time Systems
A Polynomial-Time Algorithm for Computing Response Time Bounds in Static Priority Scheduling Employing Multi-linear Workload Bounds

ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Constant-time admission control for deadline monotonic tasks

Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

The deadline-monotonic (DM) scheduling of sporadic task systems upon a preemptive uniprocessor is considered. A technique is derived for determining upper bounds on the response time of the jobs of each task, when a constrained-deadline sporadic task system is scheduled. This technique yields a generalization to a load-based sufficient schedulability condition for DM, the generalization being the added ability to account for blocking in the presence of non-preemptable serially re-usable resources.