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

• Published in: Computing Vol. 104; no. 3; pp. 577 - 599
• Main Author: Behera, Lalatendu
• Format: Journal Article
• Language: English
• Published: Vienna Springer Vienna 01.03.2022; Springer Nature B.V
• Subjects: Algorithms; Artificial Intelligence; Certification; Computer Appl. in Administrative Data Processing; Computer Communication Networks; Computer Science; Fault tolerance; Information Systems Applications (incl.Internet); Regular Paper; Safety critical; Schedules; Scheduling; Software Engineering; Time-triggered schedule; TT-Merge algorithm; 68W40; Fault-tolerant; Real-time systems; 68M20; 68M15; MCEDF; OCBP algorithm; Mixed-criticality systems; 68M01
• ISSN: 0010-485X; 1436-5057
• DOI: 10.1007/s00607-021-01026-5

Real-time and safety-critical systems are an integration of multiple functionalities onto a single computing platform. Some of the functionalities are safety-critical and subject to certification while the rest of the functionalities are nonsafety-critical and do not need the certification. Various researches have been done for the scheduling theory of mixed-criticality systems. But the time-triggered scheduling of mixed-criticality systems is very popular and used in industry. Since the schedule is prepared offline in a time-triggered mixed-criticality system, we need to prepare the schedule in such a way that the schedule must tolerate fault online. Hence the problem of fault-tolerance in the time-triggered system is important. This work proposes a new and novel time-triggered fault-tolerant algorithm for mixed-criticality systems. Then we show that the proposed algorithm is correct and tolerate at most one fault over the hyperperiod. Finally, we compare the proposed algorithm with the existing time-triggered scheduling algorithms for mixed-criticality systems.