Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
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
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Efficient implementation of tight response-times for tasks with offsets
Real-Time Systems
Improvements in polynomial-time feasibility testing for EDF
Proceedings of the conference on Design, automation and test in Europe
Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
IEEE Transactions on Computers
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
Towards a simple meta-model for complex real-time and embedded systems
MEDI'11 Proceedings of the First international conference on Model and data engineering
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
We consider sporadic tasks with static priorities and constrained deadlines to be executed upon a uniprocessor platform. Pseudo-polynomial time algorithms are known for computing worst-case response times for this task model. Some applications require to evaluate efficiently upper bounds of response times. For this purpose, we propose parametric algorithms that allow to make a tradeoff between quality of results and computational effort according to an input accuracy parameter. In this paper, we present a parametric polynomial-time algorithm for computing upper bounds of worst-case response times, that is based on an improved fptas (Fully Polynomial Time Approximation Scheme). Then, we show that our bound does not achieve constant error bound in comparison with the exact worst-case response time. However, using the resource augmentation technique, we obtain a performance guarantee that allows to define a compromise between our response-time bound and processor capacity requirements. The algorithm average behavior is then analyzed through numerical experimentations.