Skip to Main content Skip to Navigation
New interface
Conference papers

Brief Announcement: 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. Therefore, complexity of consensus implementations has become one of the most important topics in the theory of distributed computing. We are interested in consensus algorithms in which a propose operation is allowed to apply primitives other than reads and writes on the base objects only in the presence of interval contention, i.e., when another propose operation is concurrently active. Such algorithms are called interval-solo-fast.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Matthieu Roy Connect in order to contact the contributor
Submitted on : Thursday, October 1, 2015 - 3:02:30 PM
Last modification on : Friday, April 9, 2021 - 4:28:05 PM
Long-term archiving on: : Saturday, January 2, 2016 - 11:13:48 AM


Files produced by the author(s)


  • HAL Id : hal-01207895, version 1


Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. Brief Announcement: On the Uncontended Complexity of Anonymous Consensus. DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨hal-01207895⟩



Record views


Files downloads