On priority asignment in fixed priority scheduling
Information Processing Letters
Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Preemption Threshold Scheduling: Stack Optimality, Enhancements and Analysis
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Response-Time Analysis for Mixed Criticality Systems
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks
ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
| Hi-index | 0.00 |
Mixed-Criticality Scheduling (MCS) is an effective approach to addressing diverse certification requirements of safety-critical systems that integrate multiple subsystems with different levels of criticality. Preemption Threshold Scheduling (PTS) is a well-known technique for controlling the degree of preemption, ranging from fully-preemptive to fully-non-preemptive scheduling. We present schedulability analysis algorithms to enable integration of PTS with MCS, in order to bring the rich benefits of PTS into MCS, including minimizing the application stack space requirement, reducing the number of runtime task preemptions, and improving schedulability.