What people are saying - Write a review
We haven't found any reviews in the usual places.
Randomness vs FaultTolerance
14 other sections not shown
Other editions - View all
abstract ACM Symposium adversary algorithm applied assume B-frames back trace bits broadcast Byzantine failures Byzantine quorum chromatic subdivision client clock communication compare-and-swap complexity component Computer Science concurrent conflict graph consensus consider consistency construction Copyright 1997 ACM crash defined definition denote Distributed Algorithms Distributed Computing execution failure fault fault-tolerance Figure finite function garbage global Herlihy implementation initial input inref Lemma linearizability load lower bound MPEG multistamp MWCAS node non-blocking algorithm object oblivious optimal output outrefs packet permission and/or fee phase player set post on servers probabilistic problem Proc processor Proof protocol queue quorum system random rate interval registers relative liveness property requires scheduler scheme Section sequence session shared signature simplex simulation snapshot solve step synchronization Theorem Theory of Computing tion tolerance total order transaction tree tuples update variable vector wait-free