Skip to Main content Skip to Navigation
Conference papers

On the Uncontended Complexity of Anonymous Consensus

Abstract : Consensus is one of the central distributed abstractions. By enabling a collection of processes to agree on one of the values they propose, consensus can be used to implement any generic replicated service in a consistent and fault-tolerant way. In this paper, we study uncontended complexity of anonymous consensus algorithms, counting the number of memory locations used and the number of memory updates performed in operations that encounter no contention. We assume that contention-free operations on a consensus object perform "fast" reads and writes, and resort to more expensive synchronization primitives, such as CAS, only when contention is detected. We call such concurrent implementations interval-solo-fast and derive one of the first nontrivial tight bounds on space complexity of anonymous interval-solo-fast consensus.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01411528
Contributor : Colette Johnen Connect in order to contact the contributor
Submitted on : Wednesday, December 7, 2016 - 3:26:19 PM
Last modification on : Saturday, June 25, 2022 - 10:36:54 AM

Identifiers

Citation

Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. On the Uncontended Complexity of Anonymous Consensus. 19th International Conference on Principles of Distributed Systems - OPODIS 2015, Dec 2015, Rennes, France. ⟨10.4230/LIPIcs.OPODIS.2015.12⟩. ⟨hal-01411528⟩

Share

Metrics

Record views

47