A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors
| dc.creator | Halpern, Joseph Y. | |
| dc.creator | Ricciardi, Aleta | |
| dc.date | 2004-02-05 | |
| dc.date.accessioned | 2026-07-07T03:20:52Z | |
| dc.date.available | 2026-07-07T03:20:52Z | |
| dc.description | 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. | |
| dc.description | A preliminary version of this paper appeared in the 18th ACM Symposium on Principles of Distributed Computing, 1999, pp. 73-82. This version will appear in Distributed Computing | |
| dc.identifier | https://arxiv.org/abs/cs/0402012 | |
| dc.identifier | http://arxiv.org/abs/cs/0402012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31985 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.subject | C.2.2, C.2.4, F.3.1 | |
| dc.title | A Knowledge-Theoretic Analysis of Uniform Distributed Coordination and Failure Detectors | |
| dc.type | text |