A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors

Details A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors

2004-02-05

arxiv.org/abs/cs/0402012v1

Computer Science

Distributed, Parallel, and Cluster Computing

A preliminary version of this paper appeared in the 18th ACM Symposium on Principles of Distributed Computing, 1999, pp. 73-82

Scientific paper

It is shown that, in a precise sense, if there is no bound on the number of faulty processes in a system with unreliable but fair communication, Uniform Distributed Coordination (UDC) can be attained if and only if a system has perfect failure detectors. This result is generalized to the case where there is a bound t on the number of faulty processes. It is shown that a certain type of generalized failure detector is necessary and sufficient for achieving UDC in a context with at most t faulty processes. Reasoning about processes' knowledge as to which other processes are faulty plays a key role in the analysis.

Affiliated with

Also associated with

No associations

Rating

A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318311