2026-07-22T11:39:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9796 2024-03-06T10:44:57Z ddc:004 open_access

State Machine Replication Is More Expensive Than Consensus Antoniadis, Karolos Guerraoui, Rachid Malkhi, Dahlia Seredinschi, Dragos-Adrian Consensus State machine replication Synchronous model 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 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 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Karolos Antoniadis and Rachid Guerraoui and Dahlia Malkhi and Dragos-Adrian Seredinschi 2018 Is Part Of LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2018.7 urn:nbn:de:0030-drops-97961 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.7 eng https://creativecommons.org/licenses/by/3.0/legalcode