Name
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 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 interval-solo-fast and derive one of the first nontrivial tight bounds on space complexity of anonymous interval-solo-fast consensus. |
Year | Venue | Field |
|---|---|---|
2015 | OPODIS | Consensus algorithm,Synchronization,Abstraction,Computer science,Theoretical computer science,Implementation,Real-time computing,Uniform consensus,Distributed computing |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claire Capdevielle | 1 | 2 | 1.39 |
| Colette Johnen | 2 | 364 | 31.21 |
| Petr Kuznetsov | 3 | 63 | 4.69 |
| Alessia Milani | 4 | 187 | 15.54 |