A new scheduling approach for mix-criticality real-time system

Many safety-critical embedded systems are subject to meet multiple sets of certification requirements from different certification authorities. The techniques from the traditional scheduling theory cannot be satisfactorily addressed the scheduling problems in such “mixed-criticality” systems. So some scheduling algorithms such as OCBP(Own Criticality Based Priority) and CM(criticality monotonically) were presented. But they all only adapted to some cases. In this paper, we propose a new scheduling algorithm-BTW(Based Time Windows) for solving such mixed-criticality workloads. Our simulations show that BTW algorithm are most likely to be able to schedule a randomly selected task set than OCBP and CM. And it also can owns the better system utilization and the lower miss deadline ratio.