By Topic

A novel real-time fault-tolerant scheduling algorithm based on distributed control 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

4 Author(s)
Hanming Chen ; China Ship Dev. & Design Center, Wuhan, China ; Wei Luo ; Wei Wang ; Jun Xiang

In the context of real-time fault-tolerant scheduling in Distributed Control systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup-copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulabilty. In this paper, we propose a novel Fault-tolerant Rate-Monotonic Best-fit algorithm (NRMBF) based on Distributed Control systems to enhance the schedulability. Unlike existing scheduling algorithms (FTRMBF or FTRMFF) that will allocate a new processor for backup copy when no existing processors can accommodate the current backup copy to be assigned. NRMBF uses a back tracing strategy that reassign the primary copy when the aforementioned situation occurs. As a result, NRMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capability of the system. Simulation results reveal that NRMBF significantly improves the schedulabilty over existing, comparable algorithms in literature.

Published in:

Computer Science and Service System (CSSS), 2011 International Conference on

Date of Conference:

27-29 June 2011