{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:18:55Z","timestamp":1773314335569,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,11,3]],"date-time":"2013-11-03T00:00:00Z","timestamp":1383436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-0964474"],"award-info":[{"award-number":["CCF-0964474"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,11,3]]},"DOI":"10.1145\/2517349.2517350","type":"proceedings-article","created":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T13:27:04Z","timestamp":1381238824000},"page":"358-372","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":235,"title":["There is more consensus in Egalitarian parliaments"],"prefix":"10.1145","author":[{"given":"Iulian","family":"Moraru","sequence":"first","affiliation":[{"name":"Carnegie Mellon University and Intel Labs"}]},{"given":"David G.","family":"Andersen","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University and Intel Labs"}]},{"given":"Michael","family":"Kaminsky","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University and Intel Labs"}]}],"member":"320","published-online":{"date-parts":[[2013,11,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645957.758424"},{"key":"e_1_3_2_2_2_1","first-page":"223","volume-title":"Proc. of the Conference on Innovative Data system Research (CIDR)","author":"Baker J.","year":"2011","unstructured":"J. Baker , C. Bond , J. C. Corbett , J. Furman , A. Khorlin , J. Larson , J.-M. Leon , Y. Li , A. Lloyd , and V. Yushprakh . Megastore: Providing scalable, highly available storage for interactive services . In Proc. of the Conference on Innovative Data system Research (CIDR) , pages 223 -- 234 , 2011 . J. Baker, C. Bond, J. C. Corbett, J. Furman, A. Khorlin, J. Larson, J.-M. Leon, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In Proc. of the Conference on Innovative Data system Research (CIDR), pages 223--234, 2011."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2012.66"},{"key":"e_1_3_2_2_4_1","volume-title":"Proc. 7th USENIX OSDI","author":"Burrows M.","year":"2006","unstructured":"M. Burrows . The Chubby lock service for loosely-coupled distributed systems . In Proc. 7th USENIX OSDI , Seattle, WA , Nov. 2006 . M. Burrows. The Chubby lock service for loosely-coupled distributed systems. In Proc. 7th USENIX OSDI, Seattle, WA, Nov. 2006."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281150"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281103"},{"key":"e_1_3_2_2_8_1","volume-title":"Proc. 10th USENIX OSDI. USENIX","author":"Corbett J. C.","year":"2012","unstructured":"J. C. Corbett , J. Dean , M. Epstein , A. Fikes , C. Frost , J. Furman , S. Ghemawat , A. Gubarev , C. Heiser , P. Hochschild , W. Hsieh , S. Kanthak , E. Kogan , H. Li , A. Lloyd , S. Melnik , D. Mwaura , D. Nagle , S. Quinlan , R. Rao , L. Rolig , Y. Saito , M. Szymaniak , C. Taylor , R. Wang , and D. Woodford . Spanner: Google's globally-distributed database . In Proc. 10th USENIX OSDI. USENIX , 2012 . J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, W. Hsieh, S. Kanthak, E. Kogan, H. Li, A. Lloyd, S. Melnik, D. Mwaura, D. Nagle, S. Quinlan, R. Rao, L. Rolig, Y. Saito, M. Szymaniak, C. Taylor, R. Wang, and D. Woodford. Spanner: Google's globally-distributed database. In Proc. 10th USENIX OSDI. USENIX, 2012."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_2_10_1","volume-title":"High replication datastore","author":"AppEngine Google","year":"2012","unstructured":"Google AppEngine . High replication datastore , 2012 . https:\/\/developers.google.com\/appengine\/docs\/java\/datastore\/overview. Google AppEngine. High replication datastore, 2012. https:\/\/developers.google.com\/appengine\/docs\/java\/datastore\/overview."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_2_12_1","volume-title":"Proc. USENIX ATC, USENIXATC'10","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 Proc. USENIX ATC, USENIXATC'10 , Berkeley, CA, USA , 2010 . USENIX Association. P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: wait-free coordination for internet-scale systems. In Proc. USENIX ATC, USENIXATC'10, Berkeley, CA, USA, 2010. USENIX Association."},{"key":"e_1_3_2_2_13_1","volume-title":"Proc. 10th USENIX OSDI","author":"Kaptritsos M.","year":"2012","unstructured":"M. Kaptritsos , Y. Wang , V. Quema , A. Clement , L. Alvisi , and M. Dahlin . Eve: Execute-verify replication for multi-core servers . In Proc. 10th USENIX OSDI , Hollywood, CA , Oct. 2012 . M. Kaptritsos, Y. Wang, V. Quema, A. Clement, L. Alvisi, and M. Dahlin. Eve: Execute-verify replication for multi-core servers. In Proc. 10th USENIX OSDI, Hollywood, CA, Oct. 2012."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465363"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"issue":"4","key":"e_1_3_2_2_16_1","article-title":"Paxos made simple","volume":"32","author":"Lamport L.","year":"2001","unstructured":"L. Lamport . Paxos made simple . ACM SIGACT News , 32 ( 4 ), Dec. 2001 . L. Lamport. Paxos made simple. ACM SIGACT News, 32 (4), Dec. 2001.","journal-title":"ACM SIGACT News"},{"key":"e_1_3_2_2_17_1","unstructured":"L. Lamport. Generalized consensus and Paxos. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64631 2005.  L. Lamport. Generalized consensus and Paxos. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64631 2005."},{"key":"e_1_3_2_2_18_1","volume-title":"http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64624","author":"Lamport L.","year":"2006","unstructured":"L. Lamport . Fast Paxos . http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64624 , 2006 . L. Lamport. Fast Paxos. http:\/\/research.microsoft.com\/apps\/pubs\/default.aspx?id=64624, 2006."},{"key":"e_1_3_2_2_19_1","volume-title":"Microsoft Research","author":"Lamport L.","year":"2009","unstructured":"L. Lamport , D. Malkhi , and L. Zhou . Vertical Paxos and primary-backup replication. Technical report , Microsoft Research , 2009 . L. Lamport, D. Malkhi, and L. Zhou. Vertical Paxos and primary-backup replication. Technical report, Microsoft Research, 2009."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753191"},{"key":"e_1_3_2_2_22_1","volume-title":"Proc. 6th USENIX OSDI","author":"MacCormick J.","year":"2004","unstructured":"J. MacCormick , N. Murphy , M. Najork , C. A. Thekkath , and L. Zhou . Boxwood: abstractions as the foundation for storage infrastructure . In Proc. 6th USENIX OSDI , San Francisco, CA , Dec. 2004 . J. MacCormick, N. Murphy, M. Najork, C. A. Thekkath, and L. Zhou. Boxwood: abstractions as the foundation for storage infrastructure. In Proc. 6th USENIX OSDI, San Francisco, CA, Dec. 2004."},{"key":"e_1_3_2_2_23_1","first-page":"369","volume-title":"Proc. 8th USENIX OSDI","author":"Mao Y.","year":"2008","unstructured":"Y. Mao , F. P. Junqueira , and K. Marzullo . Mencius: building efficient replicated state machines for WANs . In Proc. 8th USENIX OSDI , pages 369 -- 384 , San Diego, CA , Dec. 2008 . Y. Mao, F. P. Junqueira, and K. Marzullo. Mencius: building efficient replicated state machines for WANs. In Proc. 8th USENIX OSDI, pages 369--384, San Diego, CA, Dec. 2008."},{"key":"e_1_3_2_2_24_1","volume-title":"Aug.","author":"Moraru I.","year":"2013","unstructured":"I. Moraru , D. G. Andersen , and M. Kaminsky . Epaxos code base. https:\/\/github.com\/efficient\/epaxos , Aug. 2013 . I. Moraru, D. G. Andersen, and M. Kaminsky. Epaxos code base. https:\/\/github.com\/efficient\/epaxos, Aug. 2013."},{"key":"e_1_3_2_2_25_1","volume-title":"Parallel Data Laboratory","author":"Moraru I.","year":"2013","unstructured":"I. Moraru , D. G. Andersen , and M. Kaminsky . A proof of correctness for Egalitarian Paxos. Technical report , Parallel Data Laboratory , Carnegie Mellon University , Aug. 2013 . http:\/\/www.pdl.cmu.edu\/PDL-FTP\/associated\/CMU-PDL-13-111.pdf. I. Moraru, D. G. Andersen, and M. Kaminsky. A proof of correctness for Egalitarian Paxos. Technical report, Parallel Data Laboratory, Carnegie Mellon University, Aug. 2013. http:\/\/www.pdl.cmu.edu\/PDL-FTP\/associated\/CMU-PDL-13-111.pdf."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460100061"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00397-8"},{"key":"e_1_3_2_2_28_1","unstructured":"tpc-c. TPC benchmark C. http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf 2010.  tpc-c. TPC benchmark C. http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf 2010."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_27"}],"event":{"name":"SOSP '13: ACM SIGOPS 24th Symposium on Operating Systems Principles","location":"Farminton Pennsylvania","acronym":"SOSP '13","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517349.2517350","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517349.2517350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:53Z","timestamp":1750231733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517349.2517350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,3]]},"references-count":28,"alternative-id":["10.1145\/2517349.2517350","10.1145\/2517349"],"URL":"https:\/\/doi.org\/10.1145\/2517349.2517350","relation":{},"subject":[],"published":{"date-parts":[[2013,11,3]]},"assertion":[{"value":"2013-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}