Name
Abstract | ||
|---|---|---|
Generalized Paxos (GPaxos) is a recent solution to Generalized Consensus, a distributed problem to which several key agreement problems reduce. We envision that GPaxos may unify within a single and novel Agreement-as-a-Service infrastructure multiple distributed protocols. To date this potential is however not fully unleashed, due to the steep learning curve of the protocol and the high complexity of its implementation. Moreover, before GPaxos reaches a real world usage, several computationally expensive operations have to be optimized and simplified. This paper aims at closing this gap between theory and practice. To this end, we first provide a concise tour of Generalized Paxos, hardly found elsewhere. Then, we assess the versatility of the Generalized Consensus problem by presenting a variation of GPaxos that solves the lease coordination problem. Our last contribution consists in three optimizations that apply to the critical phases of the algorithm: (i) a method to quickly start a new round, (ii) a novel approach to execute a checkpoint, and (iii) a data structure that speeds-up the detection of an agreement. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/AINA.2017.94 | 2017 IEEE 31st International Conference on Advanced Information Networking and Applications (AINA) |
Keywords | Field | DocType |
consensus,algorithms,distributed systems,fault-tolerance,reliability | Consensus,Coordination game,Data structure,Computer science,Upper and lower bounds,Computer network,Theoretical computer science,Learning curve,Paxos,Distributed computing | Conference |
ISSN | ISBN | Citations |
1550-445X | 978-1-5090-6030-6 | 0 |
PageRank | References | Authors |
0.34 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tuanir F. Rezende | 1 | 0 | 0.34 |
| Pierre Sutra | 2 | 152 | 14.73 |
| Rodrigo Q. Saramago | 3 | 0 | 0.34 |
| Lásaro Jonas Camargos | 4 | 49 | 9.24 |