Schedulability analysis of a graph-based task model for mixed-criticality systems

摘要

This paper is concerned with the problem of scheduling sporadic mixed-criticality tasks in uniprocessor systems. In these systems, tasks may not have fixed periods but minimum inter-arrival times. Further, they may have different criticality levels that determine the importance of the results computed. The system is required to complete the execution of higher critical tasks in preference to others in case of resource constraints.