This is the authors' abstract. We don't add key points for this paper.
A distributed algorithm is described for detecting and diagnosing faulty processors in an arbitrary network. Fault free processors perform simple periodic tests on one another; when a fault is detected or a newly repaired processor joins the network, this new information is disseminated in parallel throughout the network. It is formally proven that the algorithm is correct, and it is also shown that the algorithm is optimal in terms of the time required for all of the fault free processors in the network to learn of a new event. Simulation results are given for arbitrary network topologies.>
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Rangarajan et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: