Abstract
The authors address 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. They formulate the problem of determining the best timeout period T/sub out//sup / for node i as a hypothesis testing problem, and maximize the probability of detecting node failures subject to a prespecified probability of falsely diagnosing a healthy node as faulty. They outline the LS algorithm and the proposed timeout mechanism and establish a theoretical basis for the calculation of optimal T/sub out//sup /. The simulation results show that the LS algorithm, which combines online parameter estimation, the timeout mechanism, and a few extra, timely broadcasts, can significantly reduce the probability of missing task deadlines. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
