{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T10:47:57Z","timestamp":1781779677365,"version":"3.54.5"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T00:00:00Z","timestamp":1600905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No.61821003, No.61832007, No.U1705261, No.61772222"],"award-info":[{"award-number":["No.61821003, No.61832007, No.U1705261, No.61772222"]}],"id":[{"id":"10.13039\/501100001809","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":[[2020,11,30]]},"abstract":"<jats:p>Erasure codes are being extensively deployed in practical storage systems to prevent data loss with low redundancy. However, these codes require excessive disk I\/Os and network traffic for recovering unavailable data. Among all erasure codes, Minimum Storage Regenerating (MSR) codes can achieve optimal repair bandwidth under the minimum storage during recovery, but some open issues remain to be addressed before applying them in real systems.<\/jats:p>\n          <jats:p>Facing with the huge burden during recovery, erasure-coded storage systems need to be developed with high repair efficiency. Aiming at this goal, a new class of coding scheme is introduced\u2014Hybrid Regenerating Codes (Hybrid-RC). The codes utilize the superiority of MSR codes to compute a subset of data blocks while some other parity blocks are used for reliability maintenance. As a result, our design is near-optimal with respect to storage and network traffic and shows great improvements in recovery performance.<\/jats:p>","DOI":"10.1145\/3407193","type":"journal-article","created":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T06:28:24Z","timestamp":1601015304000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Hybrid Codes"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2411-1253","authenticated-orcid":false,"given":"Liuqing","family":"Ye","sequence":"first","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Key Laboratory of Information Storage System, School of Computer Science and Technology, Huazhong University of Science and Technology, Ministry of Education of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Key Laboratory of Information Storage System, School of Computer Science and Technology, Huazhong University of Science and Technology, Ministry of Education of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuchong","family":"Hu","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Key Laboratory of Information Storage System, School of Computer Science and Technology, Huazhong University of Science and Technology, Ministry of Education of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xueliang","family":"Wei","sequence":"additional","affiliation":[{"name":"Wuhan National Laboratory for Optoelectronics, Key Laboratory of Information Storage System, School of Computer Science and Technology, Huazhong University of Science and Technology, Ministry of Education of China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,9,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_2_1","volume-title":"The hadoop distributed file system: Architecture and design. Hadoop Project Website 11, 21","author":"Borthakur Dhruba","year":"2007"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/264359.264360"},{"key":"e_1_2_1_4_1","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The Theory of Error Correcting Codes Part I. Elsevier.  Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The Theory of Error Correcting Codes Part I. Elsevier."},{"key":"e_1_2_1_5_1","unstructured":"2010. Storage Architecture and Challenges. Retrieved from https:\/\/cloud.google.com\/files\/storage_architecture_and_challenges.pdf. (2010).  2010. Storage Architecture and Challenges. Retrieved from https:\/\/cloud.google.com\/files\/storage_architecture_and_challenges.pdf. (2010)."},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI \u201914)","author":"Muralidhar Subramanian","year":"2014"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 5th USENIX Workshop on Hot Topics in Storage and File Systems.","author":"Rashmi K. V.","year":"2013"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626325"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST \u201915)","author":"Xia Mingyuan"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 3rd Workshop on Network Coding, Theory, and Applications.","author":"Dimakis Alexandros G.","year":"2007"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 14th USENIX Conference on File and Storage Technologies (FAST \u201916)","author":"Pamies-Juarez Lluis","year":"2016"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2342821.2342823"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST \u201913)","author":"Plank James S."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620354"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 17th USENIX Conference on File and Storage Technologies (FAST \u201919)","author":"Zhou Tianli","year":"2019"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST \u201915)","author":"Rashmi K. V.","year":"2015"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"e_1_2_1_22_1","first-page":"10","article-title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","volume":"63","author":"Ye M.","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2017.2749255"},{"key":"e_1_2_1_24_1","first-page":"4","article-title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","volume":"63","author":"Ye M.","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST\u201918)","author":"Vajha Myna","year":"2018"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/35037.35059"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.54838"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","volume-title":"Reliable Computer Systems: Design and Evaluatuion","author":"Siewiorek Daniel","DOI":"10.1201\/9781439863961"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2003.1194851"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the International Workshop on Storage Network Architecture and Parallel I\/Os 2007 (SNAPI \u201907)","author":"Amer A.","year":"2007"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation. USENIX.","author":"Ford Daniel","year":"2010"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST\u201909)","volume":"9","author":"Plank James S.","year":"2009"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.23"},{"key":"e_1_2_1_35_1","unstructured":"Storage\u2014UMass Trace Repository. 2018. Retrieved from http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage.  Storage\u2014UMass Trace Repository. 2018. Retrieved from http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage."},{"key":"e_1_2_1_36_1","volume-title":"IOTTA Repository Home","author":"Storage Networking Industry Association","year":"2018"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the USENIX Conference on File and Storage Technologies (FAST \u201912)","author":"Khan Osama","year":"2012"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2015.18"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2010.5430243"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2345407"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3109479"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3407193","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3407193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:23Z","timestamp":1750200083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3407193"}},"subtitle":["Flexible Erasure Codes with Optimized Recovery Performance"],"short-title":[],"issued":{"date-parts":[[2020,9,24]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11,30]]}},"alternative-id":["10.1145\/3407193"],"URL":"https:\/\/doi.org\/10.1145\/3407193","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,24]]},"assertion":[{"value":"2018-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}