State Machine Replication is More Expensive than Consensus

Consensus and State Machine Replication (SMR) are generally considered to be equivalent problems. In certain system models, indeed, the two problems are computationally equivalent: any solution to the former problem leads to a solution to the latter, and vice versa. In this paper, we study the relation between consensus and SMR from a \emph{complexity} perspective. We find that, surprisingly, completing an SMR command can be more expensive than solving a consensus instance. Specifically, given a synchronous system model where every instance of consensus always terminates in constant time, completing an SMR command does \emph{not} necessarily terminate in constant time. This result naturally extends to partially synchronous models. Besides theoretical interest, our result also corresponds to practical phenomena we identify empirically. We experiment with two well-known SMR implementations (Multi-Paxos and Raft) and show that, indeed, SMR is more expensive than consensus in practice. One important implication of our result is that---even under synchrony conditions---no SMR algorithm can ensure bounded response times.

This work has been supported in part by the European ERC Grant 339539 - AOC.

Note: The status of this file is: Anyone

 Record created 2018-07-25, last modified 2020-10-24

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)