Corpus ID: 226975757

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}
}
  • Isaac C. Sheff, X. Wang, +1 author A. Myers
  • Published 2020
  • Computer Science
  • ArXiv
  • 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

    References

    SHOWING 1-10 OF 52 REFERENCES
    Byzantine quorum systems
    • 664
    • PDF
    The disagreement power of an adversary
    • 35
    • PDF
    The Honey Badger of BFT Protocols
    • 350
    • PDF