By Topic

A Novel Intelligent Algorithm for Fault-Tolerant Task Scheduling in Real-Time Multiprocessor 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)

The scheduling problem for real-time tasks on multiprocessor is one of NP-hard problems. In fault-tolerant real-time systems, tasks have deadlines to be met in spite of the presence of fault. Many attempts such as classical algorithms and intelligent methods have been made to solve this problem. Primary-backup (PB) scheme is one of the most important classical algorithms that have been employed for fault-tolerant scheduling for real-time tasks, wherein each task has two versions and the versions must be scheduled on two different processors. In this paper a novel scheduling algorithm is proposed based on genetic algorithm (GA) which uses PB for tolerating faults since all tasks employ the processors equally as much as possible.

Published in:

Convergence and Hybrid Information Technology, 2008. ICCIT '08. Third International Conference on  (Volume:2 )

Date of Conference:

11-13 Nov. 2008