Heterogeneous Paxos: Technical Report
@article{Sheff2020HeterogeneousPT, title={Heterogeneous Paxos: Technical Report}, author={Isaac C. Sheff and X. Wang and R. Renesse and A. Myers}, journal={ArXiv}, year={2020}, volume={abs/2011.08253} }
In distributed systems, a group of $\textit{learners}$ achieve $\textit{consensus}$ when, by observing the output of some $\textit{acceptors}$, they all arrive at the same value. Consensus is crucial for ordering transactions in failure-tolerant systems. Traditional consensus algorithms are homogeneous in three ways:
- all learners are treated equally,
- all acceptors are treated equally, and
- all failures are treated equally.
These assumptions, however, are unsuitable for cross-domain… CONTINUE READING
Figures and Tables from this paper
References
SHOWING 1-10 OF 52 REFERENCES
Charlotte: Composable Authenticated Distributed Data Structures, Technical Report
- Computer Science
- ArXiv
- 2019
- 2
- PDF
From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures
- Computer Science
- Comput. J.
- 2006
- 118
- PDF