Abstract:Many existing studies on mixed-criticality (MC) scheduling assume that low-criticality budgets for high-criticality applications are known apriori. These budgets are primarily used as guidance to determine when the scheduler should switch the system mode from low to high. Based on this key observation, in this paper we propose a dynamic MC scheduling model under which low-criticality budgets for individual high-criticality applications are determined at runtime as opposed to being fixed offline. To ensure suff… Show more
“…In order to guarantee resources for the HC tasks, many solutions employ a very pessimistic approach that completely discards all the LC tasks upon mode transition [15], [4], [16]. There are some works to delay the dropping of LC tasks by postponing the mode switch instant [38], [20], [23], [33]. Santy et al [39] and Bate et al [7] proposed some techniques to minimize the duration for which the system is in mode HI so that to reduce the non-service duration of LC tasks.…”
Section: Related Workmentioning
confidence: 99%
“…In this context, a plethora of studies has been carried out to improve the service offered to the LC tasks [3], [20], [28], [41], [40], [43], [5], [31], [36], [30], [18], [19], [25]. These approaches can be classified into four major categories:…”
Section: Related Workmentioning
confidence: 99%
“…2) Imprecise Computation/Reduced Execution. LC tasks are executed with reduced execution budget when the system is in mode HI [3], [5], [31], [20], [36], [30]. 3) Selective Degradation.…”
Different scheduling algorithms for mixed criticality systems have been recently proposed. The common denominator of these algorithms is to discard low critical tasks whenever high critical tasks are in lack of computation resources. This is achieved upon a switch of the scheduling mode from Normal to Critical. We distinguish two main categories of the algorithms: system-level mode switch and task-level mode switch. System-level mode algorithms allow low criticality (LC) tasks to execute only in normal mode. Task-level mode switch algorithms enable to switch the mode of an individual high criticality task (HC), from low (LO) to high (HI), to obtain priority over all LC tasks. This paper investigates an online scheduling algorithm for mixedcriticality systems that supports dynamic mode switches for both task level and system level. When a HC task job overruns its LC budget, then only that particular job is switched to HI mode. If the job cannot be accommodated, then the system switches to Critical mode. To accommodate for resource availability of the HC jobs, the LC tasks are degraded by stretching their periods until the Critical mode exhibiting job complete its execution. The stretching will be carried out until the resource availability is met. We have mechanized and implemented the proposed algorithm using Uppaal. To study the efficiency of our scheduling algorithm, we examine a case study and compare our results to the state of the art algorithms.
“…In order to guarantee resources for the HC tasks, many solutions employ a very pessimistic approach that completely discards all the LC tasks upon mode transition [15], [4], [16]. There are some works to delay the dropping of LC tasks by postponing the mode switch instant [38], [20], [23], [33]. Santy et al [39] and Bate et al [7] proposed some techniques to minimize the duration for which the system is in mode HI so that to reduce the non-service duration of LC tasks.…”
Section: Related Workmentioning
confidence: 99%
“…In this context, a plethora of studies has been carried out to improve the service offered to the LC tasks [3], [20], [28], [41], [40], [43], [5], [31], [36], [30], [18], [19], [25]. These approaches can be classified into four major categories:…”
Section: Related Workmentioning
confidence: 99%
“…2) Imprecise Computation/Reduced Execution. LC tasks are executed with reduced execution budget when the system is in mode HI [3], [5], [31], [20], [36], [30]. 3) Selective Degradation.…”
Different scheduling algorithms for mixed criticality systems have been recently proposed. The common denominator of these algorithms is to discard low critical tasks whenever high critical tasks are in lack of computation resources. This is achieved upon a switch of the scheduling mode from Normal to Critical. We distinguish two main categories of the algorithms: system-level mode switch and task-level mode switch. System-level mode algorithms allow low criticality (LC) tasks to execute only in normal mode. Task-level mode switch algorithms enable to switch the mode of an individual high criticality task (HC), from low (LO) to high (HI), to obtain priority over all LC tasks. This paper investigates an online scheduling algorithm for mixedcriticality systems that supports dynamic mode switches for both task level and system level. When a HC task job overruns its LC budget, then only that particular job is switched to HI mode. If the job cannot be accommodated, then the system switches to Critical mode. To accommodate for resource availability of the HC jobs, the LC tasks are degraded by stretching their periods until the Critical mode exhibiting job complete its execution. The stretching will be carried out until the resource availability is met. We have mechanized and implemented the proposed algorithm using Uppaal. To study the efficiency of our scheduling algorithm, we examine a case study and compare our results to the state of the art algorithms.
“…Another form of controlled degradation is proposed by Gu and Easwarn [23]. They allow HI-criticality tasks to share a budget, and thereby postpone the time when LO-criticality tasks need to be dropped.…”
Certification authorities require correctness and survivability. In the temporal domain this requires a convincing argument that all deadlines will be met under error free conditions, and that when certain defined errors occur the behaviour of the system is still predictable and safe. This means that occasional execution-time overruns should be tolerated and where more severe errors occur levels of graceful degradation should be supported. With mixed-criticality systems, fault tolerance must be criticality aware, i.e. some tasks should degrade less than others. In this paper a quantitative notion of robustness is defined, and it is shown how fixed priority-based task scheduling can be structured to maximise the likelihood of a system remaining fail operational or fail robust (the latter implying that an occasional job may be skipped if all other deadlines are met). Analysis is developed for fail operational and fail robust behaviour, optimal priority ordering is addressed and an experimental evaluation is described. Overall, the approach presented allows robustness to be balanced against schedulability. A designer would thus be able to explore the design space so defined.
“…This seriously impacts the performance which may not be suitable for many practical systems that require minimum service guarantees for these tasks [37,50]. To overcome this problem, several techniques have been proposed in the past for single-core [36][37][38][39][40][41][42][43][44][45][46][47][48][49][50][51][52][53][54] and multi-core MC systems [55][56][57][58]. These approaches can broadly be classified as follows.…”
Section: Improving the Execution Of Lc Tasksmentioning
The contributions of the co-authors are as follows:. I co-designed the problem with A/Prof Arvind Easwaran.. A/Prof Hyeonjoong Cho provided the initial project direction and helped in formulating the model.. I wrote the drafts of the manuscript. The manuscript was revised by A/Prof Arvind Easwaran.. All simulation experiments, including synthetic task set generation, was conducted by me in the Hardware and Embedded Systems Laboratory. I also analyzed the data.. A/Prof Arvind Easwaran assisted in designing experiments and provide guidance in the interpretation of simulation data.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.