By Topic

Task assignment and scheduling in fault-tolerant 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

2 Author(s)
Tein-Hsiang Lin ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Buffalo, NY, USA ; Wernhuar Tarng

Task assignment and scheduling are two important problems for the design of distributed systems. However, due to system complexity and large task numbers, finding optimal solutions is usually very difficult. In this paper, we develop a heuristic algorithm to perform task assignment and scheduling in fault-tolerant distributed real-time systems. In static, the algorithm computes task assignment quickly to find sub-optimal solutions satisfying all requirements. During system operation, the periods of tasks under different fault conditions are dynamically adjusted to adapt to the loss of system resources. Our goal aims at improving system performance by fully utilizing computing resources, including all spare units. Analytical and simulation results are provided to evaluate the efficiency of this algorithm.<>

Published in:

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on  (Volume:1 )

Date of Conference:

19-21 Oct. 1993