Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption

Authors:
T. H. C. Nguyen;N. S. Tran;V. H. Le;Pascal Richard
Affiliations:
VNU--University of Engineering and Technology, Hanoi, Vietnam;VNU--University of Engineering and Technology, Hanoi, Vietnam;VNU--University of Engineering and Technology, Hanoi, Vietnam;LIAS--University of Poitiers and ENSMA, Poitiers, France
Venue:
Proceedings of the 21st International conference on Real-Time Networks and Systems
Year:
2013

Citing 17
Cited 0

Preemptive priority-based scheduling: an appropriate engineering approach

Advances in real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
An Event Stream Driven Approximation for the Analysis of Real-Time Systems

ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Measuring the Performance of Schedulability Tests

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
Tightening the Bounds on Feasible Preemption Points

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions

RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications 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
Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption

Real-Time Systems
Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems
Feasibility analysis under fixed priority scheduling with limited preemptions

Real-Time Systems
Optimal Selection of Preemption Points to Minimize Preemption Overhead

ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Cache Related Pre-emption Delay Aware Response Time Analysis for Fixed Priority Pre-emptive Systems

RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems

Real-Time Systems
Optimal Fixed Priority Scheduling with Deferred Pre-emption

RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider real-time tasks under fixed-priority scheduling with deferred preemption (FPDS) and arbitrary deadlines. Exact response time analysis is known but exhibits to high computational cost. Effective sufficient test has been proposed under certain conditions and still subjects to pseudo-polynomial complexity. Some applications require efficiently computed response time bounds. In this paper, we provide a novel exact processor demand analysis. Based on this, we define a parametric polynomial time algorithm that both analyzes the approximate feasibility and computes the response time upper bounds. Using the resource augmentation technique, we obtain a performance guarantee that allows defining a compromise between the response-time bound and processor capacity requirements. Finally, the algorithm average behavior is analyzed through numerical experiments.