By Topic

Task scheduling in hard real-time distributed systems on a bus local area network

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)
Hao, Y. ; Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA ; Liu, J.-C. ; Kim, J.L.

The authors propose a scheme for global scheduling in a distributed system using a bus network, which is shared by nodes in the system through a contention-free medium access protocol. Unlike existing solutions, the scheme does not require complete global state information to be collected for a node that has an unschedulable aperiodic task to find a node that can execute the task. The nodes are organized in the system in a logical ring fashion to synchronize the global scheduling process. To evaluate the performance of the scheme, two protocols are developed. Simulation results show that the performance of the scheme is close to an ideal distributed system, in which the centralized global scheduler takes care of aperiodic tasks without any communication and task migration overhead.<>

Published in:

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Date of Conference:

1-3 April 1992