{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:09Z","timestamp":1750306329955,"version":"3.41.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T00:00:00Z","timestamp":1496188800000},"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":["61025008, 61232004 and 61173043"],"award-info":[{"award-number":["61025008, 61232004 and 61173043"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2013TS043"],"award-info":[{"award-number":["2013TS043"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National High Technology Research and Development Program of China","award":["2013AA013203"],"award-info":[{"award-number":["2013AA013203"]}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China","doi-asserted-by":"crossref","award":["2011CB302301"],"award-info":[{"award-number":["2011CB302301"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Technology R8D Program of China","award":["2011BAH04B02"],"award-info":[{"award-number":["2011BAH04B02"]}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"crossref","award":["2015CFB192"],"award-info":[{"award-number":["2015CFB192"]}],"id":[{"id":"10.13039\/501100003819","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":[[2017,5,31]]},"abstract":"<jats:p>Erasure codes are widely used in modern distributed storage systems to prevent data loss and server failures. Regenerating codes are a class of erasure codes that trade storage efficiency and computation for repair bandwidth reduction. However, their nonunified coding parameters and huge computational overhead prohibit their applications. Hence, we first propose a family of General Functional Regenerating (GFR) codes with uncoded repair, balancing storage efficiency and repair bandwidth with general parameters. The GFR codes take advantage of a heuristic repair algorithm, which makes efforts to employ as little repair bandwidth as possible to repair a single failure. Second, we also present a scheduled shift multiplication (SSM) algorithm, which accelerates the matrix product over the Galois field by scheduling the order of coding operations, so encoding and repairing of GFR codes can be executed by fast bitwise shifting and exclusive-OR. Compared to the traditional table-lookup multiplication algorithm, our SSM algorithm gains 1.2 to 2 X speedup in our experimental evaluations, with little effect on the repair success rate.<\/jats:p>","DOI":"10.1145\/3051122","type":"journal-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T12:18:36Z","timestamp":1497356316000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["High-Performance General Functional Regenerating Codes with Near-Optimal Repair Bandwidth"],"prefix":"10.1145","volume":"13","author":[{"given":"Qing","family":"Liu","sequence":"first","affiliation":[{"name":"WNLO, Huazhong University of Science and Technology, Luoyu Road, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Feng","sequence":"additional","affiliation":[{"name":"WNLO, Huazhong University of Science and Technology, Luoyu Road, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchong","family":"Hu","sequence":"additional","affiliation":[{"name":"WNLO, Huazhong University of Science and Technology, Luoyu Road, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhan","family":"Shi","sequence":"additional","affiliation":[{"name":"WNLO, Huazhong University of Science and Technology, Luoyu Road, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Fu","sequence":"additional","affiliation":[{"name":"WNLO, Huazhong University of Science and Technology, Luoyu Road, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"H. P. Anvin. 2015. The mathematics of RAID-6. (2015). https:\/\/www.kernel.org\/pub\/linux\/kernel\/people\/hpa\/raid6.pdf.  H. P. Anvin. 2015. The mathematics of RAID-6. (2015). https:\/\/www.kernel.org\/pub\/linux\/kernel\/people\/hpa\/raid6.pdf."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1993.627346"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.167"},{"key":"e_1_2_1_4_1","unstructured":"Daniel Cullina Alexandros G. Dimakis and Tracey Ho. 2009. Searching for minimum storage regenerating codes. arXiv:0910.2245.  Daniel Cullina Alexandros G. Dimakis and Tracey Ho. 2009. Searching for minimum storage regenerating codes. arXiv:0910.2245."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2008.4770564"},{"volume-title":"Proceedings of the 2nd USENIX Conference on Hot Topics in Storage and File Systems. 5.","author":"Greenan Kevin M.","key":"e_1_2_1_8_1"},{"volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies (FAST\u201912)","year":"2012","author":"Hu Yuchong","key":"e_1_2_1_9_1"},{"volume-title":"Proceedings of the 2011 International Symposium on Network Coding (NetCod\u201911)","author":"Hu Yuchong","key":"e_1_2_1_10_1"},{"volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201912)","author":"Huang C.","key":"e_1_2_1_11_1"},{"volume-title":"VTune Amplifier XE 2015. 2015. What\u2019s new? - Intel\u00aeVTuneTM Amplifier XE 2015. (2015","year":"2015","author":"Intel","key":"e_1_2_1_12_1"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.40"},{"volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies (FAST\u201912)","year":"2012","author":"Khan Osama","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/356989.357007"},{"volume-title":"Proceedings of the 12th USENIX Conference on File and Storage Technologies (FAST\u201914)","author":"Li Mingqiang","key":"e_1_2_1_16_1"},{"volume-title":"Lee","year":"2013","author":"Li Runhui","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCGrid.2015.38"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2093139.2093141","article-title":"Efficient software implementations of large finite fields GF (2 n) for secure storage applications","volume":"8","author":"Luo Jianqiang","year":"2012","journal-title":"ACM Transactions on Storage"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.23"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"James S. Plank. 1997. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software\u2014Practice and Experience 27 9 995--1012.  James S. Plank. 1997. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software\u2014Practice and Experience 27 9 995--1012.","DOI":"10.1002\/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.0.CO;2-6"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342009106191"},{"volume-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies (FAST\u201913)","author":"Plank James S.","key":"e_1_2_1_24_1"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1525908.1525927"},{"volume-title":"Proceedings of the 5th IEEE International Symposium on Network Computing and Applications (NCA\u201906)","author":"James","key":"e_1_2_1_26_1"},{"volume-title":"Proceedings of the 2014 ACM Conference on SIGCOMM (SIGCOMM\u201914)","author":"Rashmi K. V.","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"volume-title":"Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton\u201909)","author":"Rashmi K. V.","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"volume-title":"Proceedings of the 5th USENIX Conference on File and Storage Technologies (FAST\u201907)","author":"Schroeder Bianca","key":"e_1_2_1_32_1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"volume-title":"Proceedings of the 2012 IEEE International Symposium on Information Theory (ISIT\u201912)","author":"Kenneth","key":"e_1_2_1_34_1"},{"volume-title":"Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST\u201910)","author":"Shvachko K.","key":"e_1_2_1_35_1"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Itzhak Tamo Zhiying Wang and Jehoshua Bruck. 2011. Zigzag codes: MDS array codes with optimal rebuilding. arXiv:1112.0371.  Itzhak Tamo Zhiying Wang and Jehoshua Bruck. 2011. Zigzag codes: MDS array codes with optimal rebuilding. arXiv:1112.0371.","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Anyu Wang and Zhifang Zhang. 2012. Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage. arXiv:1207.0879.  Anyu Wang and Zhifang Zhang. 2012. Exact cooperative regenerating codes with minimum-repair-bandwidth for distributed storage. arXiv:1207.0879.","DOI":"10.1109\/INFCOM.2013.6566803"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2012.6232371"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3051122","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3051122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:38Z","timestamp":1750222478000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3051122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,31]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/3051122"],"URL":"https:\/\/doi.org\/10.1145\/3051122","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2017,5,31]]},"assertion":[{"value":"2015-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}