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.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01207895
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 3:02:30 PM
Last modification on : Tuesday, October 6, 2015 - 1:00:41 AM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:13:48 AM

File

41-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207895, version 1

Collections

Citation

Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. Brief Announcement: On the Uncontended Complexity of Anonymous Consensus. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. <hal-01207895>

Share

Metrics

Record views

88

Document downloads

51