Abstract
The Total algorithms are used within asynchronous faulttolerant distributed systems to derive a total order on messages from a causal order provided by an underlying multicast communication protocol. We present several Total algorithms that represent varying compromises between latency to message ordering and resilience to crash and Byzantine faults. The algorithms use a multi-stage voting strategy to achieve agreement on the total order, and depend on the random structure of the causal order to achieve probabilistic termination.KeywordsTotal OrderCausal OrderAsynchronous SystemFaulty ProcessPrevious MessageThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
