IMDEA Networks Institute Publications Repository

Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus)

Arévalo, Sergio and Fernández Anta, Antonio and Imbs, Damien and Jiménez, Ernesto and Raynal, Michel (2012) Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus). In: The 32nd International Conference on Distributed Computing Systems (ICDCS 2012), 18-21 June 2012, Macau, China.

PDF (Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus) ) - Published Version
Download (182Kb) | Preview


This paper is on homonymous distributed systems where processes are prone to crash failures and have no initial knowledge of the system membership (“homonymous” means that several processes may have the same identifier). New classes of failure detectors suited to these systems are first defined. Among them, the classes HΩ and HΣ are introduced that are the homonymous counterparts of the classes Ω and Σ, respectively. (Recall that the pair hΩ,Σi defines the weakest failure detector to solve consensus.) Then, the paper shows how HΩ and HΣ can be implemented in homonymous systems without membership knowledge (under different synchrony requirements). Finally, two algorithms are presented that use these failure detectors to solve consensus in homonymous asynchronous systems where there is no initial knowledge of the membership. One algorithm solves consensus with hHΩ, HΣi, while the other uses only HΩ, but needs a majority of correct processes. Observe that the systems with unique identifiers and anonymous systems are extreme cases of homonymous systems from which follows that all these results also apply to these systems. Interestingly, the new failure detector class HΩ can be implemented with partial synchrony, while the analogous class AΩ defined for anonymous systems can not be implemented(even in synchronous systems). Hence, the paper provides us with the first proof showing that consensus can be solved in anonymous systems with only partial synchrony (and a majority of correct processes).

Item Type: Conference or Workshop Papers (Paper)
Additional Information: Also in: XX Jornadas de Concurrencia y Sistemas Distribuidos, JCSD 2012, 13-15 June 2012, Pamplona, Spain.
Uncontrolled Keywords: Agreement problem, Asynchrony, Consensus, Distributed computability, failure detector, Homonymous system, Message-passing, Process crash.
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
T Technology > T Technology (General)
T Technology > TA Engineering (General). Civil engineering (General)
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Antonio Fernandez
Date Deposited: 07 Nov 2012 09:21
Last Modified: 03 Dec 2014 08:21

Actions (login required)

View Item View Item