Predictability in Mixed-Criticality Systems
Rany Kahil, Peter Poplavko, Dario Socci, Saddek Bensalem · 2018
In this paper, we revisit and refine our previous research on schedulability testing for fixed set of dual-critical jobs. Such systems can be tested for tight job termination time bounds using simulation, under the prerequisite that the scheduling policy be predictable. We give a more precise, less restrictive generalization of the notion of predictability to mixed criticality systems. We prove that this property is inherent for an important class of scheduling policies and that it justifies testing the system using basic scenarios.