LIPIcs.DISC.2019.38.pdf
- Filesize: 406 kB
- 3 pages
Document
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model
Authors
-
Part of:
Volume:
33rd International Symposium on Distributed Computing (DISC 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2019-10-08
Cite As Get BibTex
Grégoire Bonin, Achour Mostéfaoui, and Matthieu Perrin. Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 38:1-38:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.DISC.2019.38
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Distributed computing models
Keywords
- Concurrent object
- Consensus
- Infinite arrival model
- Linearizability
- Universal construction
- Wait-freedom
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Keren Censor-Hillel, Erez Petrank, and Shahar Timnat. Help! In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pages 241-250. ACM, 2015.
-
Panagiota Fatourou and Nikolaos D. Kallimanis. Highly-Efficient Wait-Free Synchronization. Theory Comput. Syst., 55(3):475-520, 2014.
-
Maurice Herlihy. Impossibility and Universality Results for Wait-Free Synchronization. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, August 15-17, 1988, pages 276-290, 1988.
-
Michael Merritt and Gadi Taubenfeld. Resilient consensus for infinitely many processes. In International Symposium on Distributed Computing, pages 1-15. Springer, 2003.
-
Michel Raynal. Distributed Universal Constructions: a Guided Tour. Bulletin of the EATCS, 121, 2017.