Real-Time Scheduling Algorithm for Safety-Critical Systems on Faulty Multicore Environments
Journal article, 2017

An algorithm (called FTM) for scheduling of real-time sporadic tasks on a multicore platform is proposed. Each task has a deadline by which it must complete its non-erroneous execution. The FTM algorithm executes backups in order to recover from errors caused by non-permanent and permanent hardware faults. The worst-case schedulability analysis of FTM algorithm is presented considering an application-level error model, which is independent of the stochastic behavior of the underlying hardware-level fault model. Then, the stochastic behavior of hardware-level fault model is plugged in to the analysis to derive the probability of meeting all the deadlines. Such probabilistic guarantee is the level of assurance (i.e., reliability) regarding the correct functional and timing behaviors of the system. One of the salient features of FTM algorithm is that it executes some backups in active redundancy to exploit the parallel multicore architecture while other backups passively to avoid unnecessary execution of too many active backups. This paper also proposes a scheme to determine for each task the number of backups that should run in active redundancy in order to increase the probability of meeting all the deadlines. The effectiveness of the proposed approach is demonstrated using an example application.

Fault-tolerant systems

Global multiprocessor scheduling

Real-time systems

Schedulability tests

Probabilistic analysis

Author

Risat Pathan

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Real-Time Systems

0922-6443 (ISSN) 1573-1383 (eISSN)

Vol. 53 1 45-81

Subject Categories

Computer Engineering

Areas of Advance

Information and Communication Technology

DOI

10.1007/s11241-016-9258-z

More information

Created

10/7/2017