Stack-based scheduling for realtime processes
Real-Time Systems
Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
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
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
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
Resilience analysis: tightening the CRPD bound for set-associative caches
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Preemption Points Placement for Sporadic Task Sets
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
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
Optimal Selection of Preemption Points to Minimize Preemption Overhead
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
Job Phasing Aware Preemption Deferral
EUC '11 Proceedings of the 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing
Extending fixed task-priority schedulability by interference limitation
Proceedings of the 20th International Conference on Real-Time and Network Systems
Optimal Fixed Priority Scheduling with Deferred Pre-emption
RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
Preemption delay analysis for floating non-preemptive region scheduling
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
| Hi-index | 0.00 |
Preemption is a key factor against architectural coupling in concurrent systems. The whole verification process of real-time systems postulates composability in multiple dimensions, including time. As coupling wrecks composability, the design of real-time systems really needs preemption. However preemption effects complicate feasibility analysis or make it more pessimistic. Hence methods that limit preemptions without affecting feasibility are attractive. State-of-the-art approaches to limited preemption, however, do not treat resource sharing with the importance that it deserves. The placement of non-preemptive regions -- and their interactions with shared resources -- should not become a design problem, but rather stay as an implementation level feature that does not backtrack to the design space. In this paper we present a refinement to the state-of-the-art limited preemption model that addresses the interaction with resource sharing, and discuss a kernel implementation that uses run-time knowledge to warrant safe and efficient over-laps between critical sections and non-preemptive regions. Experimental results prove the effectiveness of the proposed solution.