A simple proof of the necessity of the failure detector $\Sigma$ to implement a register in asynchronous message-passing systems

François Bonnet (1) , Michel Raynal (1)

1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems

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.

Mots clés: Asynchronous message-passing system; Atomic register; Necessity proof; Process crash; Weakest failure detector

Domaines: Performance et fiabilité [cs.PF]

François Bonnet, Michel Raynal. A simple proof of the necessity of the failure detector $\Sigma$ to implement a register in asynchronous message-passing systems. [Research Report] PI 1932, 2009, pp.8. ⟨inria-00392450⟩