Towards Mixed-Critical Real-time Scheduling

Mixed-criticality system (MCS) is one of the upcoming and most challenging research areas in embedded systems. Real-time (RT) scheduling for MCS is a key aspect done during design time to analyze the schedulability and strictly guarantee the timing of various critical tasks. This paper tries to study if the existing non-MCS preemptive scheduling approach for periodic and aperiodic tasks can be extended to uniprocessor MCS. A comparison between the maximum response time for the tasks in a non-MCS and MCS is performed. It is inferred that the conventional preemptive scheduler is sufficient but does not give minimal response time for a high critical task. This provides the groundwork to further explore and contribute to the research area.