Communication-efficient and crash-quiescent Omega with unknown membership
详细信息 查看全文
- 作者：Sergio Aré ; valo ; Ernesto Jimé ; nez ; Mikel Larrea ; Luis Mengual
- 关键词：Distributed computing ; Fault tolerance ; Unreliable failure detectors
- 刊名：Information Processing Letters
- 出版年：2011
- 出版时间：15 January 2011
- 年：2011
- 卷：111
- 期：4
- 页码：194-199
- 全文大小：150 K
文摘
The failure detector class Omega (Ω) provides an eventual leader election functionality, i.e., eventually all correct processes permanently trust the same correct process. An algorithm is communication-efficient if the number of links that carry messages forever is bounded by n, being n the number of processes in the system. It has been defined that an algorithm is crash-quiescent if it eventually stops sending messages to crashed processes. In this regard, it has been recently shown the impossibility of implementing Ω crash quiescently without a majority of correct processes. We say that the membership is unknown if each process pi only knows its own identity and the number of processes in the system (that is, i and n), but pi does not know the identity of the rest of processes of the system. There is a type of link (denoted by ADD link) in which a bounded (but unknown) number of consecutive messages can be delayed or lost.
In this work we present the first implementation (to our knowledge) of Ω in partially synchronous systems with ADD links and with unknown membership. Furthermore, it is the first implementation of Ω that combines two very interesting properties: communication-efficiency and crash-quiescence when the majority of processes are correct. Finally, we also obtain with the same algorithm a failure detector () such that every correct process eventually and permanently outputs the set of all correct processes.