By Topic

Fault-tolerant scheduling of real-time tasks having software 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
$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

2 Author(s)
Khan, G.N. ; Electr. & Comput. Eng., Ryerson Univ., Toronto, Ont. ; Sydhom, A.

This paper investigates the problem of fault-tolerant scheduling of a set of real-time tasks where each task has primary and alternate implementations. Similar scheduling problem has been studied before, however, we propose an enhanced scheme for scheduling real-time periodic tasks with software faults. Alternate-primary recovery (APR) based scheduling employs a special backup-primary that can replace the primary when it fails often. The new scheduling technique saves the CPU time wasted on executing of unsuccessful primaries again and again. APR scheduling is implemented and tested for a TRC (TCP-to-RS232 converter) embedded system that connects Ethernet to serial-RS232 devices. It is also compared with an existing fault-tolerant scheduling method to verify the proposed enhancement

Published in:

Electrical and Computer Engineering, 2005. Canadian Conference on

Date of Conference:

1-4 May 2005