A simple proof of the necessity of the failure detector $\Sigma$ to implement a register in asynchronous message-passing systems
Abstract
This paper presents a simple proof that the quorum failure detector class (denoted ) is the weakest failure detector class required to implement an atomic read/write register in an asynchronous message-passing system prone to an arbitrary number of process crashes.
Origin : Files produced by the author(s)
Loading...