Abstract: Asynchronous algorithms for implementing a fault-tolerant distributed system, which can make progress despite the failure of any F processors, require 2F + 1 processors. Cheap Paxos, a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback