{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:46:26Z","timestamp":1782405986371,"version":"3.54.5"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:00:00Z","timestamp":1782345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2024YFB4504400"],"award-info":[{"award-number":["2024YFB4504400"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Major Research Plan of the National Natural Science Foundation of China","award":["92373114"],"award-info":[{"award-number":["92373114"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["624B2120"],"award-info":[{"award-number":["624B2120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2023J06001"],"award-info":[{"award-number":["2023J06001"]}]},{"name":"Xiaomi Young Scholars"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>Erasure-coded storage systems adopt multiple redundancy levels to balance reliability and storage efficiency under changing workloads. However, transitioning data across different redundancy configurations incurs high network overhead due to data relocation and parity recomputation, especially under successive transitions. Existing approaches are typically optimized for fixed parameters and lack flexibility and scalability.<\/jats:p>\n                  <jats:p>\n                    This article presents\n                    <jats:sans-serif>FlexRT<\/jats:sans-serif>\n                    , a flexible and efficient redundancy transitioning framework for erasure-coded systems.\n                    <jats:sans-serif>FlexRT<\/jats:sans-serif>\n                    employs a linear-hashing\u2013based stripe placement that decouples stripe layout from coding parameters, enabling zero data relocation across successive transitions. To minimize parity update overhead,\n                    <jats:sans-serif>FlexRT<\/jats:sans-serif>\n                    binds encoding coefficients to physical nodes instead of logical stripe positions, allowing parity to be incrementally updated even when data blocks are reorganized. In addition, a greedy sub-stripe decomposition and matching algorithm maximizes parity reuse and reduces the amount of data involved in recomputation, transforming redundancy transitioning into an efficient split-and-merge process.\n                  <\/jats:p>\n                  <jats:p>\n                    We implement\n                    <jats:sans-serif>FlexRT<\/jats:sans-serif>\n                    in a C++ prototype and evaluate it through large-scale simulations and Alibaba Cloud experiments. Results show that\n                    <jats:sans-serif>FlexRT<\/jats:sans-serif>\n                    reduces transitioning traffic by 86.0%\u201394.1% and shortens transition time by 79.4%\u201389.2% compared with state-of-the-art schemes, while completely eliminating data relocation.\n                  <\/jats:p>","DOI":"10.1145\/3801101","type":"journal-article","created":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:11:22Z","timestamp":1773090682000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["FlexRT: Enabling Flexible and Efficient Redundancy Transitioning in Erasure-Coded Systems"],"prefix":"10.1145","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7762-3252","authenticated-orcid":false,"given":"Fulin","family":"Nan","sequence":"first","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4439-5974","authenticated-orcid":false,"given":"Liang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4249-8866","authenticated-orcid":false,"given":"Zehai","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9008-5401","authenticated-orcid":false,"given":"Ronglong","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2673-5868","authenticated-orcid":false,"given":"Zhirong","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2477-381X","authenticated-orcid":false,"given":"Zhifeng","family":"Bao","sequence":"additional","affiliation":[{"name":"The University of Queensland","place":["Brisbane, Australia"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2765-4509","authenticated-orcid":false,"given":"Dmitrii","family":"Kaplun","sequence":"additional","affiliation":[{"name":"Saint Petersburg Electrotechnical University LETI","place":["Saint Petersburg, Russian Federation"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7362-2789","authenticated-orcid":false,"given":"Jiwu","family":"Shu","sequence":"additional","affiliation":[{"name":"School of Informatics, Xiamen University","place":["Xiamen, China"]},{"name":"Minjiang University","place":["Xiamen, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592816"},{"key":"e_1_3_1_3_2","first-page":"351","volume-title":"Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201914)","author":"Balakrishnan Shobana","year":"2014","unstructured":"Shobana Balakrishnan, Richard Black, Austin Donnelly, Paul England, Adam Glass, Dave Harper, Sergey Legtchenko, Aaron Ogus, Eric Peterson, and Antony Rowstron. 2014. Pelican: A building block for exascale cold data storage. In Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201914). 351\u2013365."},{"key":"e_1_3_1_4_2","unstructured":"Brian Beach. 2019. Backblaze Vaults: Zettabyte-Scale Cloud Storage Architecture. Retrieved July 9 2024 from https:\/\/www.backblaze.com\/blog\/vault-cloud-storage-architecture\/"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2016.26"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2025.3614839"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3357223.3362713"},{"key":"e_1_3_1_9_2","unstructured":"Alibaba Cloud. 2025. Elastic Compute Service (ECS): Elastic & Secure Cloud Servers. Retrieved September 10 2025 from https:\/\/www.alibabacloud.com\/en\/product\/ecs"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2013.6575356"},{"key":"e_1_3_1_12_2","unstructured":"Apache Software Foundation. 2024. HDFS Erasure Coding. Retrieved December 21 2024 from https:\/\/hadoop.apache.org\/docs\/stable\/hadoop-project-dist\/hadoop-hdfs\/HDFSErasureCoding.html"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254153"},{"key":"e_1_3_1_14_2","first-page":"233","volume-title":"Proceedings of the 19th USENIX Conference on File and Storage Technologies (FAST\u201921)","author":"Hu Yuchong","year":"2021","unstructured":"Yuchong Hu, Liangfeng Cheng, Qiaori Yao, Patrick P. C. Lee, Weichun Wang, and Wei Chen. 2021. Exploiting combined locality for wide-stripe erasure coding in distributed storage. In Proceedings of the 19th USENIX Conference on File and Storage Technologies (FAST\u201921). 233\u2013248."},{"key":"e_1_3_1_15_2","first-page":"15","volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201912)","author":"Huang Cheng","year":"2012","unstructured":"Cheng Huang, Huseyin Simitci, Yikang Xu, Aaron Ogus, Brad Calder, Parikshit Gopalan, Jin Li, and Sergey Yekhanin. 2012. Erasure coding in windows azure storage. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201912). 15\u201326."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2326156"},{"key":"e_1_3_1_17_2","first-page":"413","volume-title":"Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201922)","author":"Kadekodi Saurabh","year":"2022","unstructured":"Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, and Gregory R. Ganger. 2022. Tiger: Disk-adaptive redundancy without placement restrictions. In Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201922). 413\u2013429."},{"key":"e_1_3_1_18_2","first-page":"369","volume-title":"Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201920)","author":"Kadekodi Saurabh","year":"2020","unstructured":"Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, and Gregory R. Ganger. 2020. PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. In Proceedings of the 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201920). 369\u2013385."},{"key":"e_1_3_1_19_2","first-page":"345","volume-title":"Proceedings of the 17th USENIX Conference on File and Storage Technologies (FAST\u201919)","author":"Kadekodi Saurabh","year":"2019","unstructured":"Saurabh Kadekodi, K. V. Rashmi, and Gregory R. Ganger. 2019. Cluster storage systems gotta have HeART: Improving storage efficiency by exploiting disk-reliability heterogeneity. In Proceedings of the 17th USENIX Conference on File and Storage Technologies (FAST\u201919). 345\u2013358."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173947"},{"key":"e_1_3_1_21_2","series-title":"ITCS\u201920","first-page":"66:1\u201366:26","volume-title":"Proceedings of the 11th Innovations in Theoretical Computer Science Conference","volume":"151","author":"Maturana Francisco","year":"2020","unstructured":"Francisco Maturana and K. V. Rashmi. 2020. Convertible codes: New class of codes for efficient conversion of coded data in distributed storage. In Proceedings of the 11th Innovations in Theoretical Computer Science Conference(ITCS\u201920, Vol. 151). 66:1\u201366:26."},{"key":"e_1_3_1_22_2","first-page":"383","volume-title":"Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201914)","author":"Muralidhar Subramanian","year":"2014","unstructured":"Subramanian Muralidhar, Wyatt Lloyd, Sabyasachi Roy, Cory Hill, Ernest Lin, Weiwen Liu, Satadru Pan, Shiva Shankar, Viswanath Sivakumar, Linpeng Tang, et\u00a0al. 2014. f4: Facebook\u2019s warm BLOB storage system. In Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201914). 383\u2013398."},{"key":"e_1_3_1_23_2","unstructured":"OpenStack. 2024. Erasure Code Support. Retrieved November 21 2024 from https:\/\/docs.openstack.org\/swift\/latest\/overview_erasure_code.html"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536234"},{"key":"e_1_3_1_25_2","first-page":"81","volume-title":"Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST\u201916)","author":"Pamies-Juarez Lluis","year":"2016","unstructured":"Lluis Pamies-Juarez, Filip Blagojevic, Robert Mateescu, Cyril Gyuot, Eyal En Gad, and Zvonimir Bandic. 2016. Opening the Chrysalis: On the real repair performance of MSR codes. In Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST\u201916). 81\u201394."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"e_1_3_1_27_2","article-title":"Jerasure: A Library in C\/C++ Facilitating Erasure Coding for Storage Applications Version 1.2","volume":"23","author":"Plank James","year":"2008","unstructured":"James Plank, Scott Simmerman, and Catherine Schuman. 2008. Jerasure: A Library in C\/C++ Facilitating Erasure Coding for Storage Applications Version 1.2. Technical Report 23 . University of Tennessee.","journal-title":"Technical Report"},{"key":"e_1_3_1_28_2","article-title":"GF-complete: A Comprehensive Open Source Library for Galois Field Arithmetic Version 1.02","author":"Plank James S.","year":"2014","unstructured":"James S. Plank, Ethan L. Miller, Kevin M. Greenan, Benjamin A. Arnold, John A. Burnum, Adam W. Disney, and Allen C. McBride. 2014. GF-complete: A Comprehensive Open Source Library for Galois Field Arithmetic Version 1.02. Technical Report. University of Tennessee.","journal-title":"Technical Report"},{"key":"e_1_3_1_29_2","first-page":"331","volume-title":"Proceedings of the ACM Conference on SIGCOMM (SIGCOMM\u201914)","author":"Rashmi K. V.","year":"2014","unstructured":"K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, and Kannan Ramchandran. 2014. A \u201cHitchhiker\u2019s\u201d guide to fast and efficient data reconstruction in erasure-coded data centers. In Proceedings of the ACM Conference on SIGCOMM (SIGCOMM\u201914). 331\u2013342."},{"key":"e_1_3_1_30_2","first-page":"401","volume-title":"Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916)","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 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201916). 401\u2013417."},{"key":"e_1_3_1_31_2","first-page":"81","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915)","author":"Rashmi K. V.","year":"2015","unstructured":"K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, and Kannan Ramchandran. 2015. Having your cake and eating it too: Jointly optimal erasure codes for I\/O, storage, and network-bandwidth. In Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915). 81\u201394."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190536"},{"key":"e_1_3_1_34_2","first-page":"139","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST\u201918)","author":"Vajha Myna","year":"2018","unstructured":"Myna Vajha, Vinayak Ramkumar, Bhagyashree Puranik, Ganesh Kini, Elita Lobo, Birenjith Sasidharan, P. Vijay Kumar, Alexandar Barg, Min Ye, Srinivasan Narayanamurthy, et\u00a0al. 2018. Clay codes: Moulding MDS codes to yield an MSR code. In Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST\u201918). 139\u2013154."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/2822895"},{"key":"e_1_3_1_36_2","first-page":"267","volume-title":"Proceedings of the 18th USENIX Conference on File and Storage Technologies (FAST\u201920)","author":"Wang Ao","year":"2020","unstructured":"Ao Wang, Jingyuan Zhang, Xiaolong Ma, Ali Anwar, Lukas Rupprecht, Dimitrios Skourtis, Vasily Tarasov, Feng Yan, and Yue Cheng. 2020. InfiniCache: Exploiting ephemeral serverless functions to build a cost-effective memory cache. In Proceedings of the 18th USENIX Conference on File and Storage Technologies (FAST\u201920). 267\u2013281."},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404397.3404420"},{"key":"e_1_3_1_38_2","volume-title":"Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201906)","author":"Weil Sage A.","year":"2006","unstructured":"Sage A. Weil, Scott A. Brandt, Ethan L. Miller, Darrell D. E. Long, and Carlos Maltzahn. 2006. Ceph: A scalable, high-performance distributed file system. In Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation (OSDI\u201906)."},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2012.24"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796704"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS51746.2020.00032"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155417"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.5555\/2750482.2750499"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00053"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/3672077"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/1227835.1227838"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.150"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2019.00006"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485961"},{"key":"e_1_3_1_50_2","volume-title":"Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST\u201911)","author":"Zheng Weimin","year":"2011","unstructured":"Weimin Zheng and Guangyan Zhang. 2011. FastScale: Accelerate RAID scaling by minimizing data migration. In Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST\u201911)."},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2876827"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3801101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T15:55:06Z","timestamp":1782402906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3801101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3801101"],"URL":"https:\/\/doi.org\/10.1145\/3801101","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]},"assertion":[{"value":"2025-10-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}