By Topic

Incorporation of optimal timeouts into distributed real-time load sharing

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
$33 $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)
Chao-Ju Hou ; Real-Time Comput. Lab., Michigan Univ., Ann Arbor, MI, USA ; K. G. Shin

Consideration is given to the problem of designing and incorporating a timeout mechanism into load sharing (LS) with state-region change broadcasts in the presence of node failures in a distributed real-time system. Failure of a node is diagnosed by the other nodes through communication timeouts, and the timeout period used to diagnose whether a node is faulty or not usually depends on the dynamic changes in system load, the task attributes at the node, and the state the node was initially in. We formulate the problem of determining the “best” timeout period Tout(i) for node i as a hypothesis testing problem, and maximize the probability of detecting node failures subject to a pre-specified probability of falsely diagnosing a healthy node as faulty. The parameters needed for the calculation of Tout(i) are estimated online by node i using the Bayesian technique and are piggy-backed in its region-change broadcasts. The broadcast information is then used to determine Tout(i). If node n has not heard from node i for Tout(i) since its receipt of the latest broadcast from node i, it will consider node i failed, and will not consider any task transfer to node i until it receives a broadcast message from node i again. On the other hand, to further reduce the probability of incorrect diagnosis, each node n also determines its own timeout period Tout(n), and broadcasts its state not only at the time of state-region changes but also when it has remained within a broadcast interval throughout Tout(n)

Published in:

IEEE Transactions on Computers  (Volume:43 ,  Issue: 5 )