In this paper we are interested in mixed-criticality embedded applications implemented on distributed architectures. Depending on their time-criticality, tasks can be hard or soft real-time and regarding safety-criticality, tasks can be fault-tolerant to transient faults, permanent faults, or have no dependability requirements. We use Earliest Deadline First (EDF) scheduling for the hard tasks and the Constant Bandwidth Server (CBS) for the soft tasks. The CBS parameters determine the quality of service (QoS) of soft tasks. Transient faults are tolerated using checkpointing with roll- back recovery. For tolerating permanent faults in processors, we use task migration, i.e., restarting the safety-critical tasks on other processors. We propose a Greedy-based on- line heuristic for the migration of safety-critical tasks, in response to permanent faults, and the adjustment of CBS parameters on the target processors, such that the faults are tolerated, the deadlines for the hard real-time tasks are satisfied and the QoS for soft tasks is maximized. The proposed online adaptive approach has been evaluated using several synthetic benchmarks and a real-life case study.
|Title of host publication||SIGBED Review--Special Issue on the 2nd International Workshop on Adaptive and Reconfigurable Embedded Systems (APRES'09)|
|Volume||Volume 6, Number 3|
|Publication status||Published - 2009|
|Event||2nd International Workshop on Adaptive and Reconfigurable Embedded Systems - |
Duration: 1 Jan 2009 → …
|Conference||2nd International Workshop on Adaptive and Reconfigurable Embedded Systems|
|Period||01/01/2009 → …|