Stack-based scheduling for realtime processes
Real-Time Systems
Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemptive Scheduling
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The Spring Kernel: A New Paradigm for Real-Time Systems
IEEE Software
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Multiple process execution in cache related preemption delay analysis
Proceedings of the 4th ACM international conference on Embedded software
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
Measuring the Performance of Schedulability Tests
Real-Time Systems
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
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
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Quantifying the cost of context switch
Proceedings of the 2007 workshop on Experimental computer science
Optimal task placement to improve cache performance
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Preemption Points Placement for Sporadic Task Sets
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points
RTCSA '10 Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications
Extending fixed task-priority schedulability by interference limitation
Proceedings of the 20th International Conference on Real-Time and Network Systems
Preemption delay analysis for floating non-preemptive region scheduling
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
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
Limited preemptive scheduling of non-independent task sets
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
Preemptive scheduling often generates a significant runtime overhead that may increase task worst-case execution times up to 40%, with respect to a fully non-preemptive execution. In small embedded systems, such an extra cost results in longer and more variable response times that can significantly affect the overall energy consumption, as well as the system predictability. Limiting preemptions is often possible without jeopardizing schedulability. Although several authors addressed schedulability analysis under different forms of limited preemptive scheduling, current results exhibit two major deficiencies: (i) The maximum lengths of the non-preemptive regions for each task are still unknown under fixed priorities; (i) The exact response time analysis for tasks with fixed preemption points is too complex.This paper presents the schedulability analysis of real-time tasks with non-preemptive regions, under fixed priority assignments. In particular, two different preemption models are considered: the floating and the fixed preemption point model. Under each model, the feasibility analysis is addressed by deriving simple and effective schedulability tests, as well as an algorithm for computing the maximum length of the non-preemptive regions for each task. Finally, simulation experiments are presented to compare the two models in terms of schedulability.