An Effective RM-Based Scheduling Algorithm for Fault-Tolerant Real-Time Systems

2009 ◽  
Author(s):  
Wanfu Ding ◽  
Ruifeng Guo
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Time Systems

A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

2019 ◽  
Vol 10 (3) ◽  
pp. 58-75 ◽  
Author(s):  
Barkahoum Kada ◽  
Hamoudi Kalla
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Transient Faults ◽  
Spare Capacity ◽  
Tolerance Approach ◽  
Architecture Simulation ◽  
Hard Real Time ◽  
Time Systems

Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.

A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

2021 ◽  
pp. 770-788
Author(s):  
Barkahoum Kada ◽  
Hamoudi Kalla
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Transient Faults ◽  
Application Time ◽  
Spare Capacity ◽  
Architecture Simulation ◽  
Hard Real Time ◽  
Time Systems

Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.

scholarly journals Review Paper on Fault Tolerant Scheduling in Multicore System

2018 ◽  
pp. 75-83
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Real Time Systems ◽  
Recovery Method ◽  
Agricultural Vulnerability ◽  
Task Scheduling Algorithm ◽  
Multicore System ◽  
User Space ◽  
Time Systems

In this paper, it was discussed about various fault tolerant task scheduling Algorithm for the multicore system based on hardware and software. Blend of triple module redundancy and double module redundancy considering Agricultural vulnerability factor other than EDF and LLF scheduling algorithms were used to create hardware-based algorithm. Most of the real-time systems used shared memory as dominant part. Low overhead software-based fault tolerance approach could be implemented at user space level so that it did not require any changes at an application level. Redundant multithread processes were used which could detect soft recover from the errors and could recover from them giving low overhead, fast error mechanism recovery, and detection. The overhead incurred by this method ranged from 0 to 8% for selected benchmarks. Another system used for scheduling approach in real-time systems was hybrid scheduling. Dynamic fault tolerating scheduling gave high feasibility where task critically was used to select the fault recovery method type in order to tolerate maximum no. of faults.

Sign in / Sign up

Export Citation Format

Share Document