Fault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems

@article{Zhou2017FaultTolerantTS,
  title={Fault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems},
  author={Junlong Zhou and Min Yin and Zhifang Li and Kun Cao and Jianming Yan and Tongquan Wei and Mingsong Chen and Xin Fu},
  journal={J. Circuits Syst. Comput.},
  year={2017},
  volume={26},
  pages={1750016:1-1750016:17}
}
Integration of safety-critical tasks with different certification requirements onto a common hardware platform has become a growing tendency in the design of real-time and embedded systems. In the past decade, great efforts have been made to develop techniques for handling uncertainties in task worst-case execution time, quality-of-service, and schedulability of mixed-criticality systems. However, few works take fault-tolerance as a design requirement. In this paper, we address the scheduling… 

Figures and Tables from this paper

A Mixed-Criticality Approach to Fault Tolerance: Integrating Schedulability and Failure Requirements

This paper proposes an extension to the traditional MC scheduling theory to implement fault tolerance strategies against transient faults, with the goal of complying with both failure and timing requirements, and introduces the dropping relationships that generalize the concept of criticality.

A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems

This work proposes a new and novel time-triggered fault-tolerant algorithm for mixed-criticality systems and shows that the proposed algorithm is correct and tolerate at most one fault over the hyperperiod.

FANTOM: Fault Tolerant Task-Drop Aware Scheduling for Mixed-Criticality Systems

A realistic MC task model is proposed and a design-time task-drop aware schedulability analysis based on the Earliest Deadline First with Virtual Deadline (EDF-VD) algorithm is developed that improves the acceptance ratio by up to 43.9% compared to state-of-the-art.

Optimization of Fault-Tolerant Mixed-Criticality Multi-Core Systems with Enhanced WCRT Analysis

A novel optimization technique of fault-tolerant mixed-criticality multi-core systems with worst-case response time (WCRT) guarantees is proposed and the analysis is improved in order to tighten the pessimism of WCRT estimates by considering the maximum number of faults to be tolerated.

Lifetime-aware real-time task scheduling on fault-tolerant mixed-criticality embedded systems

Schedulability Analysis Towards Arbitrarily Activated Tasks in Mixed-Criticality Systems

This paper extends the sporadically activated task model to the arbitrarilyactivated task model in MCs with the preemptive fixed-task-priority schedule and presents the necessary and sufficient schedulability tests based on the well-established results from Real-Time Calculus.

Fault Tolerant Scheduling in Mixed Critical Systems: A Case Study

  • Preeti GodaboleG. Bhole
  • Computer Science
    2019 9th International Symposium on Embedded Computing and System Design (ISED)
  • 2019
The empirical evaluation and simulation of partitioned and global approaches of scheduling for the avionics task set gives an insight of issues in achieving reliability.

A Review of Recent Techniques in Mixed-Criticality Systems

This research presents a meta-modelling architecture suitable for mixed-critical embedded systems, which aims to provide real-time information about the physical and software properties of an embedded system to help designers and developers design and implement integrated circuits.

Effective Real-Time Scheduling Optimization for Multi-Functional Mixed-Criticality Systems

An algorithm called rearrangement-based scheduling for MMCS (RSM) is developed, which can achieve lower overall makespan and deadline miss ratios (DMRs) than the existing algorithms.

References

SHOWING 1-10 OF 30 REFERENCES

Fault-tolerant and real-time scheduling for mixed-criticality systems

  • R. Pathan
  • Computer Science
    Real-Time Systems
  • 2014
A new approach to model mixed-criticality systems from the perspective of fault tolerance is proposed, and a uniprocessor fixed-priority scheduling algorithm, called fault-tolerant mixed- criticality (FTMC) scheduling, is designed for the proposed model.

On the scheduling of fault-tolerant mixed-criticality systems

This paper model explicitly the safety requirements for tasks of different criticalities according to safety standards, assuming hardware transient faults, and provides analysis techniques to bound the effects of task killing and service degradation on the system safety and schedulability.

Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities

It is proved that the well-known Audsley’s algorithm is optimal for assigning priorities to tasks with multiple criticality levels, and a sensitivity analysis for multipleCriticality tasks that is based on Bini et al. results on sporadic tasks is presented.

Response-Time Analysis for Mixed Criticality Systems

This paper considers a novel implementation scheme for fixed priority uniprocessor scheduling of mixed criticality systems that requires that jobs have their execution times monitored and sufficient response-time analysis is provided.

An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems

A priority-based algorithm for scheduling mixed criticality systems, derive an algorithm for computing priorities, and obtain a sufficient schedulability condition for efficiently determining whether a given mixed-criticality system can be successfully scheduled by this algorithm.

Static mapping of mixed-critical applications for fault-tolerant MPSoCs

This paper builds up a design space exploration engine that optimizes fault-tolerant mixed-criticality MPSoCs and provides worst-case guarantees, and studies the mapping optimization considering judicious task dropping, that may impose a certain service degradation.

Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications

This paper conducts a thorough study of the feasibility and schedulability questions for such multi-criticality real-time task systems when implemented upon preemptive uniprocessor platforms.

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems

An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is described for the scheduling of such mixed-criticality task systems, andalyses of EF-VD significantly superior to previously-known ones are presented, based on metrics such as processor speedup factor and utilization bounds.

Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance

  • S. Vestal
  • Business
    28th IEEE International Real-Time Systems Symposium (RTSS 2007)
  • 2007
This paper presents ways to use information from a conjecture that the more confidence one needs in a task execution time bound, the larger and more conservative that bound tends to become in practice.

A unified approach for fault tolerance and dynamic power management in fixed-priority real-time embedded systems

  • Y. ZhangK. Chakrabarty
  • Computer Science
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2006
Numerical results based on real-life checkpointing data and processor data sheets show that the proposed approach significantly reduces power consumption and guarantees timely task completion in the presence of faults.