By Topic

Fault-Tolerant Real-Time Scheduling Algorithm for Tolerating Multiple Transient Faults

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Risat Mahmud Pathan ; Department of Computer Science and Engineering, BRAC University, 66, Mohakhali, Dhaka-1212, Bangladesh. E-mail:

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.

Published in:

2006 International Conference on Electrical and Computer Engineering

Date of Conference:

19-21 Dec. 2006