{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:52:39Z","timestamp":1763459559344,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T00:00:00Z","timestamp":1507161600000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1302197,CNS-1423182"],"award-info":[{"award-number":["CNS-1302197,CNS-1423182"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,5]]},"DOI":"10.1145\/2987550.2987572","type":"proceedings-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T08:42:53Z","timestamp":1474447373000},"page":"210-222","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Randomized Algorithms for Dynamic Storage Load-Balancing"],"prefix":"10.1145","author":[{"given":"Liang","family":"Liu","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lance","family":"Fortnow","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yating","family":"Wang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.30865"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535929"},{"key":"e_1_3_2_1_3_1","first-page":"147","article-title":"Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista","volume":"5","author":"Birkhoff D.","year":"1946","unstructured":"D. Birkhoff. Tres observaciones sobre el algebra lineal. Universidad Nacional de Tucuman Revista, Serie A, 5:147--151, 1946.","journal-title":"Serie A"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.59854"},{"key":"e_1_3_2_1_5_1","first-page":"21","article-title":"The hadoop distributed file system: Architecture and design","volume":"11","author":"Borthakur D.","year":"2007","unstructured":"D. Borthakur. The hadoop distributed file system: Architecture and design. Hadoop Project Website, 11(2007):21, 2007.","journal-title":"Hadoop Project Website"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043571"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832560"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/507553.507563"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2671003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675365"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675365"},{"issue":"0","key":"e_1_3_2_1_12_1","first-page":"73","article-title":"Lower and upper bounds for the bin packing problem with fragile objects. Discrete Applied Mathematics, 163","volume":"1","author":"Clautiaux F.","year":"2014","unstructured":"F. Clautiaux, M. DellAmico, M. Iori, and A. Khanafer. Lower and upper bounds for the bin packing problem with fragile objects. Discrete Applied Mathematics, 163, Part 1(0):73--86, 2014. ISSN 0166-218X. Matheuristics 2010.","journal-title":"Part"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74450-4_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1165389.945450"},{"key":"e_1_3_2_1_16_1","volume-title":"Perfect matchings in O(nlogn) time in regular bipartite graphs. CoRR, abs\/0909.3346","author":"Goel A.","year":"2009","unstructured":"A. Goel, M. Kapralov, and S. Khanna. Perfect matchings in O(nlogn) time in regular bipartite graphs. CoRR, abs\/0909.3346, 2009. URL arxiv.org\/abs\/0909.3346."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2342821.2342823"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2208461.2208481"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1958-0095128-8"},{"key":"e_1_3_2_1_20_1","volume-title":"Introducing zone redundant storage. bit.ly\/1LFsA44","author":"Storage Team Microsoft Azure","year":"2014","unstructured":"Microsoft Azure Storage Team. Introducing zone redundant storage. bit.ly\/1LFsA44, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486007"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113401"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2010.24"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1298455.1298485"},{"key":"e_1_3_2_1_27_1","volume-title":"Does erasure coding have a role to play in my data center. Microsoft research MSR-TR-2010, 52","author":"Zhang Z.","year":"2010","unstructured":"Z. Zhang, A. Deshpande, X. Ma, E. Thereska, and D. Narayanan. Does erasure coding have a role to play in my data center. Microsoft research MSR-TR-2010, 52, 2010."}],"event":{"name":"SoCC '16: ACM Symposium on Cloud Computing","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Santa Clara CA USA","acronym":"SoCC '16"},"container-title":["Proceedings of the Seventh ACM Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2987550.2987572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2987550.2987572","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2987550.2987572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:48:40Z","timestamp":1763459320000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2987550.2987572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,5]]},"references-count":27,"alternative-id":["10.1145\/2987550.2987572","10.1145\/2987550"],"URL":"https:\/\/doi.org\/10.1145\/2987550.2987572","relation":{},"subject":[],"published":{"date-parts":[[2016,10,5]]},"assertion":[{"value":"2016-10-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}