{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T18:29:40Z","timestamp":1785522580194,"version":"3.56.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T00:00:00Z","timestamp":1421712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGOPS Oper. Syst. Rev."],"published-print":{"date-parts":[[2015,1,20]]},"abstract":"<jats:p>The Paxos algorithm is famously difficult to reason about and even more so to implement, despite having been synonymous with distributed consensus for over a decade. The recently proposed Raft protocol lays claim to being a new, understandable consensus algorithm, improving on Paxos without making compromises in performance or correctness.<\/jats:p>\n          <jats:p>In this study, we repeat the Raft authors' performance analysis. We developed a clean-slate implementation of the Raft protocol and built an event-driven simulation framework for prototyping it on experimental topologies. We propose several optimizations to the Raft protocol and demonstrate their effectiveness under contention. Finally, we empirically validate the correctness of the Raft protocol invariants and evaluate Raft's understandability claims.<\/jats:p>","DOI":"10.1145\/2723872.2723876","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T14:05:51Z","timestamp":1422453951000},"page":"12-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":66,"title":["Raft Refloated"],"prefix":"10.1145","volume":"49","author":[{"given":"Heidi","family":"Howard","sequence":"first","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malte","family":"Schwarzkopf","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anil","family":"Madhavapeddy","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jon","family":"Crowcroft","sequence":"additional","affiliation":[{"name":"University of Cambridge Computer Laboratory"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"CoreOS website. http:\/\/coreos.com. Accessed on 02\/09\/2014.  CoreOS website. http:\/\/coreos.com. Accessed on 02\/09\/2014."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Bolosky W. J.","year":"2011","unstructured":"W. J. Bolosky , D. Bradshaw , R. B. Haagens , N. P. Kusters , and P. Li . Paxos replicated state machines as the basis of a highperformance data store . In Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI) , 2011 . W. J. Bolosky, D. Bradshaw, R. B. Haagens, N. P. Kusters, and P. Li. Paxos replicated state machines as the basis of a highperformance data store. In Proceedings of the 8th USENIX Symposium on Networked Systems Design and Implementation (NSDI), 2011."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298487"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_6_1","first-page":"135","volume-title":"Proceedings of the USENIX Annual Technical Conference","author":"Clark B.","year":"2004","unstructured":"B. Clark , T. Deshane , E. Dow , S. Evanchik , M. Finlayson , J. Herne , and J. N. Matthews . Xen and the art of repeated research . In Proceedings of the USENIX Annual Technical Conference , pages 135 -- 144 , 2004 . B. Clark, T. Deshane, E. Dow, S. Evanchik, M. Finlayson, J. Herne, and J. N. Matthews. Xen and the art of repeated research. In Proceedings of the USENIX Annual Technical Conference, pages 135--144, 2004."},{"key":"e_1_2_1_7_1","volume-title":"Measuring reproducibility in computer systems. Technical report","author":"Collberg C.","year":"2014","unstructured":"C. Collberg , T. Proebsting , G. Moraila , A. Shankaran , Z. Shi , and A. M. Warren . Measuring reproducibility in computer systems. Technical report , University of Arizona , 2014 . C. Collberg, T. Proebsting, G. Moraila, A. Shankaran, Z. Shi, and A. M. Warren. Measuring reproducibility in computer systems. Technical report, University of Arizona, 2014."},{"key":"e_1_2_1_8_1","volume-title":"Aug.","author":"Delzanno G.","year":"2014","unstructured":"G. Delzanno , M. Tatarek , and R. Traverso . Model Checking Paxos in Spin. ArXiv e-prints , Aug. 2014 . G. Delzanno, M. Tatarek, and R. Traverso. Model Checking Paxos in Spin. ArXiv e-prints, Aug. 2014."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_12_1","first-page":"145","volume-title":"Proceedings of the 2010 USENIX Annual Technical Conference (USENIX ATC)","volume":"8","author":"Hunt P.","year":"2010","unstructured":"P. Hunt , M. Konar , F. P. Junqueira , and B. Reed . ZooKeeper: wait-free coordination for internet-scale systems . In Proceedings of the 2010 USENIX Annual Technical Conference (USENIX ATC) , volume 8 , pages 145 -- 158 , 2010 . P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: wait-free coordination for internet-scale systems. In Proceedings of the 2010 USENIX Annual Technical Conference (USENIX ATC), volume 8, pages 145--158, 2010."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.367309"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_15_1","first-page":"18","volume-title":"Paxos made simple. ACM SIGACT News 32.4","author":"Lamport L.","year":"2001","unstructured":"L. Lamport . Paxos made simple. ACM SIGACT News 32.4 , pages 18 -- 25v i, 2001 . L. Lamport. Paxos made simple. ACM SIGACT News 32.4, pages 18--25vi, 2001."},{"key":"e_1_2_1_16_1","volume-title":"Distributed Computing, 19(2):79--103","author":"Lamport L.","year":"2006","unstructured":"L. Lamport . Fast Paxos . Distributed Computing, 19(2):79--103 , 2006 . L. Lamport. Fast Paxos. Distributed Computing, 19(2):79--103, 2006."},{"key":"e_1_2_1_17_1","first-page":"307","volume-title":"Cheap Paxos. In Proceedings of the International Conference on Dependable Systems and Networks","author":"Lamport L.","year":"2004","unstructured":"L. Lamport and M. Massa . Cheap Paxos. In Proceedings of the International Conference on Dependable Systems and Networks , pages 307 -- 314 , 2004 . L. Lamport and M. Massa. Cheap Paxos. In Proceedings of the International Conference on Dependable Systems and Networks, pages 307--314, 2004."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10373-5_23"},{"key":"e_1_2_1_21_1","unstructured":"D. Mazieres. Paxos made practical. http:\/\/www.scs.stanford.edu\/~dm\/home\/papers\/paxos.pdf. Accessed on 02\/09\/2014.  D. Mazieres. Paxos made practical. http:\/\/www.scs.stanford.edu\/~dm\/home\/papers\/paxos.pdf. Accessed on 02\/09\/2014."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/62546.62549"},{"key":"e_1_2_1_24_1","unstructured":"D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm (extended version). http:\/\/ ramcloud.stanford.edu\/raft.pdf. Accessed on 13\/09\/2014.  D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm (extended version). http:\/\/ ramcloud.stanford.edu\/raft.pdf. Accessed on 13\/09\/2014."},{"key":"e_1_2_1_25_1","unstructured":"D. Ongaro and J. Ousterhout. Raft: A consensus algorithm for replicated logs (user study). http:\/\/www.youtube.com\/watch?v=YbZ3zDzDnrw. Accessed on 02\/09\/2014.  D. Ongaro and J. Ousterhout. Raft: A consensus algorithm for replicated logs (user study). http:\/\/www.youtube.com\/watch?v=YbZ3zDzDnrw. Accessed on 02\/09\/2014."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the USENIX Annual Technical Conference","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. Ousterhout . In search of an understandable consensus algorithm . In Proceedings of the USENIX Annual Technical Conference , 2014 . D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm. In Proceedings of the USENIX Annual Technical Conference, 2014."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_2_1_28_1","volume-title":"http:\/\/www.cs.cornell.edu\/courses\/cs7412\/2011sp\/paxos.pdf","author":"Renesse R. Van","year":"2011","unstructured":"R. Van Renesse . Paxos made moderately complex. http:\/\/www.cs.cornell.edu\/courses\/cs7412\/2011sp\/paxos.pdf , 2011 . Accessed on 02\/09\/2014. R. Van Renesse. Paxos made moderately complex. http:\/\/www.cs.cornell.edu\/courses\/cs7412\/2011sp\/paxos.pdf, 2011. Accessed on 02\/09\/2014."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2009.932122"},{"key":"e_1_2_1_30_1","first-page":"185","volume-title":"Proceedings of the European Simulation Multiconference","volume":"9","author":"A. Varga","year":"2001","unstructured":"A. Varga et al. The OMNeT++ discrete event simulation system . In Proceedings of the European Simulation Multiconference , volume 9 , page 185 , 2001 . A. Varga et al. The OMNeT++ discrete event simulation system. In Proceedings of the European Simulation Multiconference, volume 9, page 185, 2001."},{"key":"e_1_2_1_31_1","first-page":"213","volume-title":"Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI)","author":"Yang J.","year":"2009","unstructured":"J. Yang , T. Chen , M. Wu , Z. Xu , X. Liu , H. Lin , M. Yang , F. Long , L. Zhang , and L. Zhou . Modist: Transparent model checking of unmodified distributed systems . In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI) , pages 213 -- 228 , 2009 . J. Yang, T. Chen, M. Wu, Z. Xu, X. Liu, H. Lin, M. Yang, F. Long, L. Zhang, and L. Zhou. Modist: Transparent model checking of unmodified distributed systems. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pages 213--228, 2009."}],"container-title":["ACM SIGOPS Operating Systems Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723872.2723876","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723872.2723876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:43Z","timestamp":1750227403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723872.2723876"}},"subtitle":["Do We Have Consensus?"],"short-title":[],"issued":{"date-parts":[[2015,1,20]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1,20]]}},"alternative-id":["10.1145\/2723872.2723876"],"URL":"https:\/\/doi.org\/10.1145\/2723872.2723876","relation":{},"ISSN":["0163-5980"],"issn-type":[{"value":"0163-5980","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1,20]]},"assertion":[{"value":"2015-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}