2013/02/05 by François Santy, Santy, François, Geoffrey Nelissen +3
Computer Science · #Embedded Systems Design Techniques #FOS: Computer and information sciences #Interconnection Networks and Systems #Other Computer Science (cs.OH) #Real-Time Systems Scheduling #cs.OH
paper · pdf · doi:10.48550/arxiv.1302.1010
arxiv created 2013/02/05 · openalex publication_date 2013/02/05 · arxiv updated 2013/02/06 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Recent research in the domain of real-time scheduling theory has tackled the problem of scheduling mixed-criticality systems upon uniprocessor or multiprocessor platforms, with the main objective being to respect the timeliness of the most critical tasks, at the expense of the requirements of the less critical ones. In particular, the less critical tasks are carelessly discarded when the computation demand of (some of) the high critical tasks increases. This might nevertheless result in system failure, as these less critical tasks could be accessing data, the consistency of which should be preserved. In this paper, we address this problem and propose a method to cautiously handle task suspension. Furthermore, it is usually assumed that the less critical tasks will never be re-enabled once discarded. In this paper, we also address this concern by proposing an approach to re-enable the less critical tasks, without jeopardizing the timeliness of the high critical ones. The suggested approaches apply to systems having two or more criticality levels.