By Topic

Fault-tolerant scheduling algorithm for distributed real-time systems

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
$31 $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

3 Author(s)
Tsuchiya, T. ; Dept. of Inf. & Comput. Sci., Osaka Univ., Japan ; Kakuda, Y. ; Kikuno, T.

In a distributed real-time system, tolerance to faults on processing nodes in the system is achieved by means of redundant nodes and a fault-tolerant scheduling algorithm. Since redundant nodes increase total failure rate of the system, the number of such redundant nodes should be small. This paper proposes a procedure for fault-tolerant scheduling, which realizes fault-tolerance via a small number of redundant nodes. The procedure is based on such a technique that allows multiple copies of a task to be executed concurrently. It achieves efficient utilization of nodes by forcing copies being executed to terminate immediately after having obtained the first result of these copies. A fundamental scheduling algorithm, into which the procedure is incorporated, is defined and its simulation results are shown

Published in:

Parallel and Distributed Real-Time Systems, 1995. Proceedings of the Third Workshop on

Date of Conference:

25 Apr 1995