Skip to content

Fault-Tolerant Real-Time Systems

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Fault-Tolerant Real-Time Systems. (1996). Fault-Tolerant Real-Time Systems. Springer US.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free