EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Mixed-criticality scheduling of sporadic task systems
ESA'11 Proceedings of the 19th European conference on Algorithms
Performance evaluation of scheduling algorithms for database services with soft and hard SLAs
Proceedings of the second international workshop on Data intensive computing in the clouds
Timing faults and mixed criticality systems
Dependable and Historic Computing
PT-AMC: integrating preemption thresholds into mixed-criticality scheduling
Proceedings of the Conference on Design, Automation and Test in Europe
Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems
Proceedings of the 21st International conference on Real-Time Networks and Systems
Scheduling of mixed-criticality applications on resource-sharing multicore systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
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 studied the scheduling and analysis of mixed criticality systems that are specified as finite collections of jobs executing on a single shared preemptive processor. In this paper, we consider mixed criticality systems that are comprised of finite collections of recurrent tasks, specified using a mixed-criticality generalization of the widely-used sporadic tasks model. We design a priority-based algorithm for scheduling such systems, derive an algorithm for computing priorities, and obtain a sufficient schedulability condition for efficiently determining whether a given mixed-criticality system can be successfully scheduled by this algorithm.