By Topic

A Fault Tolerant Scheduling Algorithm for Stochastic Fault Model in Real-Time Operating System

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

2 Author(s)
Lei Chu ; Syst. Eng. Inst., Shenyang Univ. of Technol., Shenyang, China ; Xiang-dong Wang

For real-time system, fault tolerant scheduling algorithm is an important method to guarantee the timing constraints of tasks when fault occurs. In the time before, researchers usually describe faults by assuming a constant number of faults or the minimum time of fault inter-arrivals. In practice, occurrence of faults of systems are stochastic. In this paper, we model the occurrence of faults as a stochastic process with a Poisson distribution having a mean inter-arrival rate of ¿. And a fault tolerant task scheduling algorithm which is a greedy algorithm with a lower complexity of computation is given according to the fault model. Through simulation we can conclude the algorithm is effective for fault tolerant. The loss ratio of tasks on this algorithm is much lower than that in no fault scheduling algorithm.

Published in:

2009 International Conference on Information Engineering and Computer Science

Date of Conference:

19-20 Dec. 2009