Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model

Abstract : In classical asynchronous distributed systems composed of a fixed number n of processes where some proportion may fail by crashing, many objects do not have a wait-free linearizable implementation (e.g. stacks, queues, etc.). It has been proved that consensus is universal in such systems, which means that this system augmented with consensus objects allows to implement any object that has a sequential specification. In this paper, we consider a more general system model called infinite arrival model where infinitely many processes may arrive and leave or crash during a run. We prove that consensus is still universal in this more general model. For that, we propose a universal construction based on a weak log that can be implementated using consensus objects.
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02279627
Contributor : Matthieu Perrin <>
Submitted on : Thursday, September 5, 2019 - 2:27:13 PM
Last modification on : Thursday, September 12, 2019 - 8:49:21 AM

File

brief.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02279627, version 1

Collections

Citation

Grégoire Bonin, Achour Mostefaoui, Matthieu Perrin. Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. International Symposium on Distributed Computing (DISC) 2019, Oct 2019, Budapest, Hungary. ⟨hal-02279627⟩

Share

Metrics

Record views

13

Files downloads

12