From ⋄W to Ω: A simple bounded quiescent reliable broadcast-based transformation

Failure detectors in the class ⋄W ensure that every crashed process is eventually suspected by a correct process, and eventually there is a correct process that is never suspected. Failure detectors in the class Ω ensure that eventually all the processes trust the same correct process. This paper presents a very simple and efficient algorithm that transforms any failure detector of the class ⋄W into a failure detector of the class Ω. The simplicity of the transformation is due to its modular design—it is based on an underlying reliable broadcast facility. It is quiescent and requires each message to carry only one process identity, in addition to the control information appended to a message by the reliable broadcast mechanism (namely, a sequence number and the identity of its sender).