{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:26:34Z","timestamp":1775255194299,"version":"3.50.1"},"reference-count":58,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Center for Science of Information NSF","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-14-1-0403, NSF CCF-1553248 and RPF\/POST-DOC\/0916\/0090"],"award-info":[{"award-number":["FA9550-14-1-0403, NSF CCF-1553248 and RPF\/POST-DOC\/0916\/0090"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2022,11,30]]},"abstract":"<jats:p>\n            Emulating a shared\n            <jats:italic>atomic<\/jats:italic>\n            , read\/write storage system is a fundamental problem in distributed computing. Replicating atomic objects among a set of data hosts was the norm for traditional implementations (e.g.,\u00a0[\n            <jats:xref ref-type=\"bibr\">11<\/jats:xref>\n            ]) in order to guarantee the availability and accessibility of the data despite host failures. As replication is highly storage demanding, recent approaches suggested the use of erasure-codes to offer the same fault-tolerance while optimizing storage usage at the hosts. Initial works focused on a fixed set of data hosts. To guarantee longevity and scalability, a storage service should be able to dynamically mask hosts failures by allowing new hosts to join, and failed host to be removed without service interruptions. This work presents the first erasure-code -based atomic algorithm, called\n            <jats:sc>Ares<\/jats:sc>\n            , which allows the set of hosts to be modified in the course of an execution.\n            <jats:sc>Ares<\/jats:sc>\n            is composed of three main components: (i) a\n            <jats:italic>reconfiguration protocol<\/jats:italic>\n            , (ii) a\n            <jats:italic>read\/write protocol<\/jats:italic>\n            , and (iii) a set of\n            <jats:italic>data access primitives<\/jats:italic>\n            <jats:italic>(DAPs)<\/jats:italic>\n            . The design of\n            <jats:sc>Ares<\/jats:sc>\n            is modular and is such to accommodate the usage of various erasure-code parameters on a per-configuration basis. We provide bounds on the latency of read\/write operations and analyze the storage and communication costs of the\n            <jats:sc>Ares<\/jats:sc>\n            algorithm.\n          <\/jats:p>","DOI":"10.1145\/3510613","type":"journal-article","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T11:25:22Z","timestamp":1664277922000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["<scp>Ares<\/scp>\n            : Adaptive, Reconfigurable, Erasure coded, Atomic Storage"],"prefix":"10.1145","volume":"18","author":[{"given":"Nicolas","family":"Nicolaou","sequence":"first","affiliation":[{"name":"Algolysis Ltd, Limassol, Cyprus"}]},{"given":"Viveck","family":"Cadambe","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, University Park, PA"}]},{"given":"N.","family":"Prakash","sequence":"additional","affiliation":[{"name":"Intel Corp., Hillsboro, OR"}]},{"given":"Andria","family":"Trigeorgi","sequence":"additional","affiliation":[{"name":"University of Cyprus, Nicosia, Cyprus"}]},{"given":"Kishori","family":"Konwar","sequence":"additional","affiliation":[{"name":"Massachusetts Instituteof Technology, Cambridge, MA"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[{"name":"Massachusetts Instituteof Technology, Cambridge, MA"}]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[{"name":"Massachusetts Instituteof Technology, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Ansible. 2022. Retrieved 31 October 2022 from https:\/\/www.ansible.com\/overview\/how-ansible-works."},{"key":"e_1_3_2_3_2","unstructured":"Emulab network testbed. 2022. Retrieved 31 October 2022 from https:\/\/www.emulab.net\/."},{"key":"e_1_3_2_4_2","unstructured":"Intel Storage Acceleration Library (Open Source Version). 2022. Retrieved 31 October 2022 from https:\/\/goo.gl\/zkVl4N."},{"key":"e_1_3_2_5_2","unstructured":"PyEClib. 2022. Retrieved 31 October 2022 from https:\/\/github.com\/openstack\/pyeclib."},{"key":"e_1_3_2_6_2","unstructured":"PySyncObj. 2022. Retrieved 31 October 2022 from https:\/\/github.com\/bakwc\/PySyncObj."},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"ZeroMQ. 2022. Retrieved 31 October 2022 from https:\/\/zeromq.org.","DOI":"10.2307\/j.ctv2sx9gkd.22"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2018.00034"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582726"},{"key":"e_1_3_2_10_2","first-page":"84","article-title":"Reconfiguring replicated atomic storage: A tutorial","volume":"102","author":"Aguilera Marcos K.","year":"2010","unstructured":"Marcos K. Aguilera, Idit Keidar, Dahlia Malkhi, Jean-Philippe Martin, and Alexander Shraery. 2010. Reconfiguring replicated atomic storage: A tutorial. Bulletin of the EATCS 102 (2010), 84\u2013108.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_11_2","volume-title":"Proceedings of the International Conference on Principles Of Distributed Systems.","author":"Anta Antonio Fern\u00e1ndez","year":"2015","unstructured":"Antonio Fern\u00e1ndez Anta, Nicolas Nicolaou, and Alexandru Popa. 2015. Making \u201cfast\u201d atomic operations computationally tractable. In Proceedings of the International Conference on Principles Of Distributed Systems."},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","article-title":"Sharing memory robustly in message passing systems","volume":"42","author":"Attiya H.","year":"1996","unstructured":"H. Attiya, A. Bar-Noy, and D. Dolev. 1996. Sharing memory robustly in message passing systems. Journal of the ACM 42, 1 (1996), 124\u2013142.","journal-title":"Journal of the ACM"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39577-7_13"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2006.56"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2014.44"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0275-x"},{"key":"e_1_3_2_17_2","first-page":"539","volume-title":"Proceedings of the 2017 USENIX Annual Technical Conference","author":"Chen Yu Lin Chen","year":"2017","unstructured":"Yu Lin Chen Chen, Shuai Mu, and Jinyang Li. 2017. Giza: Erasure coding objects across global data centers. In Proceedings of the 2017 USENIX Annual Technical Conference. 539\u2013551."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.07.007"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0123-x"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2919285"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_13"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011802"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_6"},{"key":"e_1_3_2_24_2","volume-title":"Proceedings of the International Conference on Principles Of Distributed Systems.","author":"Anta Antonio Fern\u00e1ndez","year":"2016","unstructured":"Antonio Fern\u00e1ndez Anta, Theophanis Hadjistasi, and Nicolas Nicolaou. 2016. Computationally light \u201cmulti-speed\u201d atomic memory. In Proceedings of the International Conference on Principles Of Distributed Systems."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48653-5_10"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400817"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.05.004"},{"key":"e_1_3_2_28_2","volume-title":"RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks","author":"Gilbert Seth","year":"2003","unstructured":"Seth Gilbert. 2003. RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. Master\u2019s thesis. MIT."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2003.1209936"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2326156"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48653-5_11"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.55"},{"key":"e_1_3_2_36_2","volume-title":"Proceedings of the International Conference on Distributed Systems","author":"Konwar Kishori M.","year":"2016","unstructured":"Kishori M. Konwar, N. Prakash, Nancy Lynch, and Muriel M\u00e9dard. 2016. RADON: Repairable atomic data object in networks. In Proceedings of the International Conference on Distributed Systems."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_3_2_39_2","volume-title":"Distributed Algorithms","author":"Lynch N. A.","year":"1996","unstructured":"N. A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann Publishers."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36108-1_12"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1997.614100"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2017.36"},{"key":"e_1_3_2_43_2","unstructured":"Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. https:\/\/bitcoin.org\/bitcoin.pdf."},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","unstructured":"Nicolas Nicolaou Viveck Cadambe Kishori Konwar N. Prakash Nancy Lynch and Muriel M\u00e9dard. 2018. ARES: Adaptive reconfigurable erasure coded atomic storage. arXiv:1805.03727. Retrieved from https:\/\/arxiv.org\/abs\/1805.03727.","DOI":"10.1109\/ICDCS.2019.00216"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00216"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.5555\/2643634.2643666"},{"key":"e_1_3_2_47_2","first-page":"401","volume-title":"Proceedings of the OSDI","author":"Rashmi K. V.","year":"2016","unstructured":"K. V. Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, and Kannan Ramchandran. 2016. EC-cache: Load-balanced, low-latency cluster caching with online erasure coding. In Proceedings of the OSDI. 401\u2013417."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/1859184.1859191"},{"key":"e_1_3_2_49_2","first-page":"40:1\u201340:15","volume-title":"Proceedings of the 31st International Symposium on Distributed Computing","author":"Spiegelman Alexander","year":"2017","unstructured":"Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi. 2017. Dynamic reconfiguration: Abstraction and optimal asynchronous solution. In Proceedings of the 31st International Symposium on Distributed Computing. 40:1\u201340:15."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2017.8026881"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.32"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2013.68"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2015.111"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2466453"},{"key":"e_1_3_2_55_2","first-page":"1","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis","author":"Yu Yinghao","year":"2018","unstructured":"Yinghao Yu, Renfei Huang, Wei Wang, Jun Zhang, and Khaled Ben Letaief. 2018. SP-cache: Load-balanced, redundancy-free cluster caching with selective partition. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis. IEEE, 1\u201313."},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.210"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.5555\/2930583.2930596"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485961"},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","unstructured":"P. Zhou J. Huang X. Qin and C. Xie. 2019. PaRS: A popularity-aware redundancy scheme for in-memory stores IEEE Trans. Computers 68 4 (2019) 556\u2013569. https:\/\/dblp.org\/rec\/journals\/tc\/ZhouHQX19.html?view=bibtex.","DOI":"10.1109\/TC.2018.2876827"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510613","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:20Z","timestamp":1750191140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11,30]]}},"alternative-id":["10.1145\/3510613"],"URL":"https:\/\/doi.org\/10.1145\/3510613","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"2021-04-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-01-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}