{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:08:06Z","timestamp":1755907686757,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2238020"],"award-info":[{"award-number":["CNS-2238020"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3660273","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"379-381","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Racos: A Leaderless Erasure Coding State Machine Replication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0360-068X","authenticated-orcid":false,"given":"Jonathan","family":"Zarnstorff","sequence":"first","affiliation":[{"name":"Unaffiliated, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6770-3204","authenticated-orcid":false,"given":"Lucas","family":"Lebow","sequence":"additional","affiliation":[{"name":"Unaffiliated, Denver, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9255-0270","authenticated-orcid":false,"given":"Dillon","family":"Remuck","sequence":"additional","affiliation":[{"name":"Clark University, Worcester, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9507-1543","authenticated-orcid":false,"given":"Colin","family":"Ruiz","sequence":"additional","affiliation":[{"name":"Clark University, Worcester, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-4038","authenticated-orcid":false,"given":"Lewis","family":"Tseng","sequence":"additional","affiliation":[{"name":"Clark University, Worcester, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"volume-title":"A distributed, reliable key-value store for the most critical data of a distributed system. https:\/\/etcd.io\/, accessed","year":"2021","key":"e_1_3_2_1_1_1","unstructured":"etcd: A distributed, reliable key-value store for the most critical data of a distributed system. https:\/\/etcd.io\/, accessed May 2021."},{"volume-title":"https:\/\/charap.co\/reading-group-rabia-simplifying-statemachine- replication-through-randomization\/, accessed","year":"2024","key":"e_1_3_2_1_2_1","unstructured":"Reading group. Rabia. https:\/\/charap.co\/reading-group-rabia-simplifying-statemachine- replication-through-randomization\/, accessed Jan 2024."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"e_1_3_2_1_5_1","volume-title":"ATC","author":"Chen Y. L.","year":"2017","unstructured":"Y. L. Chen et al. Giza: Erasure coding objects across global data centers. In ATC 2017."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_7_1","volume-title":"OSDI","author":"Corbett J. C.","year":"2012","unstructured":"J. C. Corbett et al. Spanner: Google's globally-distributed database. In OSDI 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00130"},{"key":"e_1_3_2_1_10_1","volume-title":"The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133--169","author":"Lamport L.","year":"1998","unstructured":"L. Lamport. The part-time parliament. ACM Transactions on Computer Systems (TOCS), 16(2):133--169, 1998."},{"volume-title":"HPDC 2014","author":"Mu S.","key":"e_1_3_2_1_11_1","unstructured":"S. Mu et al. When paxos meets erasure code: reduce network and storage cost in state machine replication. In HPDC 2014"},{"key":"e_1_3_2_1_12_1","volume-title":"ATC","author":"Ongaro D.","year":"2014","unstructured":"D. Ongaro and J. Ousterhout. In search of an understandable consensus algorithm. In ATC 2014."},{"key":"e_1_3_2_1_13_1","volume-title":"SOSP","author":"Pan H.","year":"2021","unstructured":"H. Pan et al. Rabia: Simplifying state-machine replication through randomization. In SOSP 2021."},{"key":"e_1_3_2_1_14_1","volume-title":"FAST","author":"Pan S.","year":"2021","unstructured":"S. Pan et al. Facebook's tectonic filesystem: Efficiency from exascale. In FAST 2021."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_1_16_1","volume-title":"NSDI","author":"Uluyol M.","year":"2020","unstructured":"M. Uluyol et al. Near-optimal latency versus cost tradeoffs in geo-distributed storage. In NSDI 2020."},{"key":"e_1_3_2_1_17_1","volume-title":"FAST","author":"Wang Z.","year":"2020","unstructured":"Z. Wang et al. CRaft: An erasure-coding-supported version of raft for reducing storage cost and network cost. In FAST 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605619"}],"event":{"name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Nantes France","acronym":"SPAA '24"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660273","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3660273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:22:50Z","timestamp":1755879770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3660273"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":18,"alternative-id":["10.1145\/3626183.3660273","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3660273","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}