Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems - Archive ouverte HAL
Conference Papers Year : 2016

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems

Abstract

Atomic registers are certainly the most basic objects of computing science. Their implementation on top of an n-process asynchronous message-passing system has received a lot of attention. It has been shown that t < n/2 (where t is the maximal number of processes that may crash) is a necessary and sufficient requirement to build an atomic register on top of a crash-prone asynchronous message-passing system. Considering such a context, this paper presents an algorithm which implements a single-writer multi-reader atomic register with four message types only, and where no message needs to carry control information in addition to its type. Hence, two bits are sufficient to capture all the control information carried by all the implementation messages. Moreover, the messages of two types need to carry a data value while the messages of the two other types carry no value at all. As far as we know, this algorithm is the first with such an optimality property on the size of control information carried by messages. It is also particularly efficient from a time complexity point of view.
Fichier principal
Vignette du fichier
Counter-free-PODC-2016-submission.pdf (156.07 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02056409 , version 1 (05-03-2019)
hal-02056409 , version 2 (11-09-2024)

Identifiers

Cite

Achour Mostefaoui, Michel Raynal. Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. The 2016 ACM Symposium on Principles of Distributed Computing (PODC'16), Jul 2016, Chicago, United States. pp.381-389, ⟨10.1145/2933057.2933095⟩. ⟨hal-02056409v2⟩
100 View
90 Download

Altmetric

Share

More