On the Uncontended Complexity of Anonymous Consensus - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2015

On the Uncontended Complexity of Anonymous Consensus

(1) , (1) , (2) , (1)
1
2

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 \emph{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 \emph{interval-solo-fast} and derive the first nontrivial tight bounds on space complexity of anonymous interval-solo-fast consensus.
Fichier principal
Vignette du fichier
Anonymous-Consensus-TECH-REP.pdf (306.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01180864 , version 1 (28-07-2015)

Identifiers

  • HAL Id : hal-01180864 , version 1

Cite

Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani. On the Uncontended Complexity of Anonymous Consensus. [Research Report] University of Bordeaux LaBRI, UMR 5800, F-33400 Talence, France Telecom ParisTech. 2015. ⟨hal-01180864⟩
67 View
150 Download

Share

Gmail Facebook Twitter LinkedIn More