scholarly journals Planning and resource allocation for hard real-time, fault-tolerant plan execution

1999 ◽  
Author(s):  
Ella M. Atkins ◽  
Tarek F. Abdelzaher ◽  
Kang G. Shin ◽  
Edmund H. Durfee
Keyword(s):  
Resource Allocation ◽  
Real Time ◽  
Fault Tolerant ◽  
Plan Execution ◽  
Hard Real Time

scholarly journals Multi-criteria resource allocation in modal hard real-time systems

2017 ◽  
Vol 2017 (1) ◽  
Author(s):  
Piotr Dziurzanski ◽  
Amit Kumar Singh ◽  
Leandro Soares Indrusiak
Keyword(s):  
Resource Allocation ◽  
Real Time ◽  
Real Time Systems ◽  
Hard Real Time ◽  
Time Systems

A Fault-Tolerant Ethernet for Hard Real-Time Adaptive Systems

2019 ◽  
Vol 15 (5) ◽  
pp. 2980-2991 ◽  
Author(s):  
David Gessner ◽  
Julian Proenza ◽  
Manuel Barranco ◽  
Alberto Ballesteros
Keyword(s):  
Real Time ◽  
Adaptive Systems ◽  
Fault Tolerant ◽  
Hard Real Time

scholarly journals Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 651 ◽  
Author(s):  
Hyeongboo Baek ◽  
Jaewoo Lee
Keyword(s):  
Real Time ◽  
Fault Tolerant ◽  
Target System ◽  
Real Time Systems ◽  
Software Faults ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Hard Real Time ◽  
Deployed Systems ◽  
Time Systems

Hard real-time systems are employed in military, aeronautics, and astronautics fields where deployed systems are susceptible to software faults that can result in functional errors. Thus, there is a need to use fault-tolerant (FT) real-time scheduling. Among the various fault-tolerant real-time scheduling techniques, re-execution has been applied widely to existing real-time systems owing to its simplicity and applicability. However, re-execution requires multiple executions of every task, and some tasks miss their deadlines owing to the prolonged execution time; therefore, it has been found to be suitable for only soft real-time systems. In this paper, we propose an FT policy that can be incorporated into most (if not all) existing real-time scheduling algorithms on multiprocessor systems, which improves the reliability of the target system without a tradeoff against schedulability. As a case study, we apply the FT policy to existing fixed-priority scheduling and earliest deadline zero-laxity scheduling, and we demonstrate that it enhances reliability without schedulability loss.

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.

Sign in / Sign up

Export Citation Format

Share Document