{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:25:37Z","timestamp":1758709537974,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"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":"publisher","award":["61832011, 62172382"],"award-info":[{"award-number":["61832011, 62172382"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545038","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Repair-Optimal Data Placement for Locally Repairable Codes with Optimal Minimum Hamming Distance"],"prefix":"10.1145","author":[{"given":"Shuang","family":"Ma","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Si","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Cheng","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of USENIX ATC.","author":"Ahmad Faraz","year":"2014","unstructured":"Faraz Ahmad, Srimat T.\u00a0Chakradhar, Anand Raghunathan, and T.\u00a0N. Vijaykumar. 2014. ShuffleWatcher: Shuffle-aware Scheduling in Multi-tenant MapReduce Clusters. In Proc. of USENIX ATC."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129900"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486021"},{"key":"e_1_3_2_1_5_1","unstructured":"cisco. 2015. Cisco Systems. Oversubscription and density best practices.https:\/\/www.cisco.com\/c\/en\/us\/solutions\/collateral\/data-centervirtualization\/storage-networkingsolution\/net_implementation_white_paper0900aecd800f592f.html."},{"key":"e_1_3_2_1_6_1","unstructured":"A. Fikes.2010. Storage architecture and challenges.https:\/\/cloud.google.com\/files\/storage_architecture_and_challenges.pdf."},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of USENIX OSDI.","author":"Ford Daniel","year":"2010","unstructured":"Daniel Ford, Fran\u00e7ois Labelle, Florentina Popovici, Murray Stokely, Van-Anh Truong, Luiz Barroso, Carrie Grimes, and Sean Quinlan. 2010. Availability in globally distributed storage systems. In Proc. of USENIX OSDI."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902835"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of USENIX FAST.","author":"Hu Yuchong","year":"2021","unstructured":"Yuchong Hu, Liangfeng Cheng, Qiaori Yao, Patrick P.\u00a0C. Lee, Weichun Wang, and Wei Chen. 2021. Exploiting combined locality for Wide-Stripe Erasure Coding in distributed storage. In Proc. of USENIX FAST."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149349"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2435204.2435207","article-title":"Pyramid Codes: flexible schemes to trade space for access efficiency in reliable data storage systems","volume":"9","author":"Huang Cheng","year":"2013","unstructured":"Cheng Huang, Minghua Chen, and Jin Li. 2013. Pyramid Codes: flexible schemes to trade space for access efficiency in reliable data storage systems. ACM Trans. on Storage 9, 1 (2013), 1\u201328.","journal-title":"ACM Trans. on Storage"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of USENIX ATC.","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 Proc. of USENIX ATC."},{"key":"e_1_3_2_1_14_1","unstructured":"Bert Hubert Jacco Geul and Simon S\u00e9hier. 2017. The wonder shaper 1.4. https:\/\/github.com\/magnific0\/wondershaper."},{"key":"e_1_3_2_1_15_1","unstructured":"Oleg Kolosov Alexander Barg Itzhak Tamo and Gala Yadgar. 2018. Optimal LRC codes for all lenghts n \u2264 q. CoRR abs\/1802.00157(2018)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381832"},{"key":"e_1_3_2_1_17_1","volume-title":"Repair pipelining for erasure-coded storage: algorithms and evaluation","author":"Li Xiaolu","year":"2021","unstructured":"Xiaolu Li, Zuoru Yang, Jinhong Li, Runhui Li, Patrick P.\u00a0C. Lee, Qun Huang, and Yuchong Hu. 2021. Repair pipelining for erasure-coded storage: algorithms and evaluation.IEEE Trans. on Storage 17, 2 (2021), 29."},{"key":"e_1_3_2_1_18_1","unstructured":"libmemcached. 2014. Libmemcached. https:\/\/libmemcached.org\/libMemcached.html."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2713245"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2827053"},{"key":"e_1_3_2_1_22_1","unstructured":"Memcached. 2021. Memcached. https:\/\/memcached.org."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of USENIX OSDI.","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, and Sanjeev Kumar. 2014. F4: Facebook\u2019s Warm BLOB Storage System. In Proc. of USENIX OSDI."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of USENIX FAST.","author":"Plank S","year":"2009","unstructured":"James\u00a0S Plank, Jianqiang Luo, Catherine\u00a0D Schuman, Lihao Xu, Zooko Wilcox-O\u2019Hearn, 2009. A performance evaluation and examination of open-source erasure coding libraries for storage. In Proc. of USENIX FAST."},{"key":"e_1_3_2_1_25_1","volume-title":"Jerasure: A library in C\/C++ facilitating erasure coding for storage applications-version 1.2. Technical Report","author":"Plank S","year":"2008","unstructured":"James\u00a0S Plank, Scott Simmerman, and Catherine\u00a0D Schuman. 2008. Jerasure: A library in C\/C++ facilitating erasure coding for storage applications-version 1.2. Technical Report. University of Tennessee, Tech. Rep. CS-08-627."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806342"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of USENIX OSDI.","author":"Rashmi KV","year":"2016","unstructured":"KV Rashmi, Mosharaf Chowdhury, Jack Kosaian, Ion Stoica, and Kannan Ramchandran. 2016. EC-Cache: Load-Balanced, low-latency cluster caching with online erasure coding. In Proc. of USENIX OSDI."},{"key":"e_1_3_2_1_28_1","volume-title":"Proc. of USENIX HotStorage.","author":"Rashmi V.","year":"2013","unstructured":"K.\u00a0V. Rashmi, Nihar\u00a0B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, and Kannan Ramchandran. 2013. A solution to the network challenges of data recovery in erasure-coded distributed storage systems: A study on the Facebook warehouse cluster. In Proc. of USENIX HotStorage."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"volume-title":"Pigeonhole principle","author":"Sane S.","key":"e_1_3_2_1_31_1","unstructured":"Sharad\u00a0S. Sane. 2013. Pigeonhole principle. Hindustan Book Agency, 169\u2013192."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2017.2774299"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"e_1_3_2_1_37_1","volume-title":"Proc. of USENIX NSDI.","author":"Vulimiri Ashish","year":"2015","unstructured":"Ashish Vulimiri, Carlo Curino, P.\u00a0Brighten Godfrey, Thomas Jungblut, Jitu Padhye, and George Varghese. 2015. Global analytics in the face of bandwidth and regulatory constraints. In Proc. of USENIX NSDI."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/646334.687814"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056998"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796704"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155417"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3087352"},{"key":"e_1_3_2_1_43_1","volume-title":"Proc. of USENIX FAST.","author":"Xia Mingyuan","year":"2015","unstructured":"Mingyuan Xia, Mohit Saxena, Mario Blaum, and David\u00a0A Pease. 2015. A tale of two erasure codes in HDFS. In Proc. of USENIX FAST."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00053"}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","acronym":"ICPP '22","location":"Bordeaux France"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545038","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:43Z","timestamp":1750186963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":44,"alternative-id":["10.1145\/3545008.3545038","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545038","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}