Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
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
Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Time and Space Partitioning in Spacecraft Avionics
SMC-IT '09 Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology
Handling mixed-criticality in SoC-based real-time embedded systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
On the Scheduling of Mixed-Criticality Real-Time Task Sets
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Towards the Design of Certifiable Mixed-criticality Systems
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Implementation and evaluation of mixed-criticality scheduling approaches for sporadic tasks
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
Many safety-critical embedded systems are subject to certification requirements. However, only a subset of the functionality of the system may be safety-critical and hence subject to certification; the rest of the functionality is non safety-critical and does not need to be certified. Certification requirements in such mixed-criticality systems give rise to some interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In prior work, we have proposed a priority-based algorithm for scheduling such mixed-criticality systems on preemptive uniprocessor platforms. In this paper, we derive a sufficient schedulability condition for efficiently determining whether a given mixed-criticality system can be successfully scheduled by this algorithm. We show that this algorithm (and the associated schedulability test) is strictly superior to prior algorithms that have been used for scheduling mixed-criticality systems needing certification.