Time Complexity vs. Resilience We compare now the time complexity of the B-Consensus and the R-Consensus algorithms in “good runs.” In CDB algorithms, a good run is usually defined as a run in which no process fails and no process is falsely suspected by other processes. Here we define a good run as a run in which, for all processes p and q that do not crash, we have f irstp(1) = f irstq(1). So, contrary to the definition of good runs in the context of CDB algorithms, a good run can include process Algorithm 2 R-Consensus algorithm (f < n/3) 1: To execute propose(initV al):
Appears in 2 contracts
Sources: Research Paper, Research Paper