Skip to Main Content
The influence of computer systems in human life is increasing and thereby increases the need for having reliable, robust and real-time services of computer systems. Avoidance of any catastrophic consequences due to faults in such systems is one of the main objectives. This paper presents a fault-tolerant realtime scheduling algorithm, RM-FT, by extending the rate monotonic (RM) scheduling for real-time systems. The main approach used is employing temporal error masking (TEM) technique to achieve node level fault tolerance (NLFT) within the least common multiple of periods of a set of pre-emptively scheduled periodic tasks with at most f transient faults.