Fault tolerant task scheduling algorithm for multicore systems

Abstract

Since the Reliability is a significant need for most of the Multicore systems, using fault-tolerant techniques such as hardware replication and software re-execution have been prevalent. This paper presents an adaptive fault-tolerant task scheduling algorithm that is a combination of TMR and DMR algorithms, in which Architectural Vulnerability Factor is considered in scheduling decisions, besides EDF and LLF scheduling algorithms. The proposed algorithm has been evaluated and compared with TMR and DMR methods in total execution time and processing cores utilization considering 3 to 8 cores. According to the results our proposed fault-tolerant methods outperforms both TMR and DMR methods about 35% in average.

Fault-Tolerant in Embedded Systems (MPSoC): Performance Estimation and Dynamic Migration Task

“…In [3], the author proposes scheduling algorithm of the adaptive fault tolerant tasks which is a combination of two fault tolerant algorithm TMR (Triple Modular Redundancy) and DMR (Dual Modular Redundancy) and it also benefits from EDF and LLF task scheduling algorithms for decreasing miss rate of tasks. The main goal of these algorithms is to find a proper tasks assignment on the cores and tolerate processing component failures which could either be homogeneous or heterogeneous, so this algorithm is more perform than DMR and TMR methods in average 35% which can guarantee the proper execution of running tasks and reduce the total time of task execution.…”

A Survey on Scheduling Approaches for Hard Real-Time Systems

“…According to the real-time nature of many fault tolerant systems, it is clear that provided mechanisms for this purpose will not be consistent with the scheduling constraints of real-time applications. It should be noted, PB (Primary Backup) and TMR (Triple Module Redundancy) are two generic methods for fault tolerance in real-time tasks scheduling of multiprocessor environments [5].…”