Paper Info
Title
On the complexity of basic abstractions to implement 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. Several concurrent objects have been proposed as building blocks to implement obstruction-free consensus or wait-free consensus in distributed systems augmented with failure detectors or strong synchronization primitives.
Year
DOI
Venue
2018
10.1016/j.tcs.2017.12.039
Theoretical Computer Science
Keywords
Field
DocType
Distributed computing,Shared memory,Consensus,Wait-freedom,Complexity,Adopt-commit,Conflict-detector,Value-splitter,Grafarius
Discrete mathematics,Subset and superset,Synchronization,Abstraction,Implementation,Theoretical computer science,Mathematics
Journal
Volume
ISSN
Citations 
715
0304-3975
0
PageRank 
References 
Authors
0.34
13
3
Name
Order
Citations
PageRank
Claire Capdevielle121.39
Colette Johnen236431.21
Alessia Milani318715.54