Fault Tolerant Real Time Systems
A. Christy Persya, T.R.Gopalakrishnan Nair

TL;DR
This paper explores how fault tolerance strategies interact with the Earliest Deadline First (EDF) scheduling algorithm in real-time systems, emphasizing the importance of maintaining timely responses despite faults in safety-critical applications.
Contribution
It analyzes the integration of fault tolerance mechanisms with EDF scheduling, addressing challenges in ensuring both safety and timeliness in real-time systems.
Findings
Fault tolerance can be integrated with EDF scheduling.
Interaction affects system reliability and deadline adherence.
Strategies for fault management in real-time systems are discussed.
Abstract
Real time systems are systems in which there is a commitment for timely response by the computer to external stimuli. Real time applications have to function correctly even in presence of faults. Fault tolerance can be achieved by either hardware or software or time redundancy. Safety-critical applications have strict time and cost constraints, which means that not only faults have to be tolerated but also the constraints should be satisfied. Deadline scheduling means that the taskwith the earliest required response time is processed. The most common scheduling algorithms are :Rate Monotonic(RM) and Earliest deadline first(EDF).This paper deals with the interaction between the fault tolerant strategy and the EDF real time scheduling strategy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReal-Time Systems Scheduling · Embedded Systems Design Techniques · Distributed systems and fault tolerance
