Skip to Main content Skip to Navigation
Reports

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
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
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.
Document type :
Reports
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00392450
Contributor : Anne Jaigu <>
Submitted on : Monday, June 8, 2009 - 10:31:09 AM
Last modification on : Tuesday, June 15, 2021 - 4:13:33 PM
Long-term archiving on: : Thursday, June 10, 2010 - 8:48:00 PM

File

PI-1932.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00392450, version 1

Citation

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⟩

Share

Metrics

Record views

456

Files downloads

365