On the Uncontended Complexity of Anonymous Consensus
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...