Abstract
P f×♢ S has been shown to be the weakest realistic failure detector class needed to solve the consensus problem in an asynchronous distributed system prone to f< n process crashes in which communication is by message-passing. However, the only protocol that is known to meet this bound is based on three layers of protocol construction, and is therefore not efficient. This paper presents a surprisingly simple and very efficient direct message-passing implementation of a P f×♢ S -based consensus protocol, and proves its correctness.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call