Brief Announcement: On the Uncontended Complexity of Anonymous Consensus - Archive ouverte HAL Access content directly
Conference Papers Year :

Brief Announcement: On the Uncontended Complexity of Anonymous Consensus

(1) , (1) , (2) , (1)
1
2
Colette Johnen
Petr Kuznetsov

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.
Fichier principal
Vignette du fichier
41-BA.pdf (229.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01207895 , version 1 (01-10-2015)

Identifiers

  • HAL Id : hal-01207895 , version 1

Cite

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⟩
97 View
69 Download

Share

Gmail Facebook Twitter LinkedIn More