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

Grégoire Bonin (1, 2, 3) , Achour Mostefaoui (2, 3) , Matthieu Perrin (2, 3)

1 UN UFR ST - Université de Nantes - UFR des Sciences et des Techniques
2 LS2N - Laboratoire des Sciences du Numérique de Nantes
3 LS2N - équipe GDD - Gestion de Données Distribuées

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.

Mots clés: Concurrent object; Consensus; Infinite arrival model; Linearizability; Universal construction; Wait-freedom

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

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⟩