Tolerance to multiple transient faults for aperiodic tasks in hard real-time systems

2000 ◽  
Vol 49 (9) ◽  
pp. 906-914 ◽  
Author(s):  
F. Liberato ◽  
R. Melhem ◽  
D. Mosse
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
Transient Faults ◽  
Aperiodic Tasks ◽  
Hard Real Time ◽  
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.

Analysis on Scheduling Algorithms of Real-Time Hybrid Tasks

2014 ◽  
Vol 644-650 ◽  
pp. 2253-2257
Author(s):  
Jian Lang Wu ◽  
Jing Kai Shi ◽  
Yi Bin Wang
Keyword(s):  
Real Time ◽  
Earliest Deadline First ◽  
Real Time Systems ◽  
Extended Version ◽  
Periodic Tasks ◽  
Aperiodic Tasks ◽  
Hard Real Time ◽  
Uniprocessor Systems ◽  
Time Systems ◽  
Earliest Deadline

In real-time systems, periodic tasks and aperiodic tasks exist simultaneously. In a uniprocessor system, mainly there are Deferrable Server algorithm (DS) [1], Slack Stealing algorithm (SSA) [2] and their extended version for software/hardware hybrid real-time task scheduling. DS algorithm sets a high priority periodic task server to provide services for aperiodic tasks, while SSA algorithm computes tasks unoccupied time offline, and then schedule aperiodic tasks during the unoccupied period. The two algorithms are both proposed for soft real-time tasks, reducing the response time of the real-time tasks, but cannot guarantee that these aperiodic real-time tasks received can meet deadlines. In this paper, through combination of DS algorithm and EDF (Earliest Deadline First) algorithm [6], a new algorithm called DS-EDF is introduced, which can scheduling hard real-time aperiodic tasks on the DS server. This algorithm is not only suitable for uniprocessor systems, but also has the ability to extend to multiprocessor systems.

Sign in / Sign up

Export Citation Format

Share Document