Dynamic scheduling algorithm and its schedulability analysis for certifiable dual-criticality systems
Tae-Ju Park, Soontae Kim · 2011
Real-time embedded systems are becoming more complex to include multiple functionalities. Sharing a computing platform is a natural and effective solution to reducing the cost of those systems. However, the sharing can cause serious problems in mixed-criticality systems where applications have different levels of criticality. Certifying the mixed-criticality systems requires efficient scheduling algorithms and schedulability tests different from the ones used in single criticality systems.