IEEE Transactions on Computers · 1994 · 22 citations · 26 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsFault-tolerant ComputingFault-tolerant SystemsDiagnosisDistributed AlgorithmsDistributed ComputingFault DetectionFault DiagnosisReliable Distributed SystemsDistributed DiagnosticsDistributed Fault DetectionDistributed Fault DiagnosisFault-tolerant Distributed AlgorithmsFault-tolerant Distributed SystemsInformation DisseminationNetwork Fault DiagnosisSystem Diagnosis
Consider a network consisting of units connected by links in which some units could be faulty. Suppose each unit has a message which must be transmitted to all other (fault-free) units. We present an algorithm for doing this in a network operating in a fully distributed manner that requires at most 3n logn+O(n) message transmissions by fault-free units. Among other things, our result can be used to devise an algorithm for distributed system level diagnosis which is more efficient than the best currently known algorithm for this purpose.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
26
Elections in a Distributed Computing System
Garcia-Molina · IEEE Transactions on Computers · 1982 · 614 citations