{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:12:18Z","timestamp":1759133538021,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,10,31]],"date-time":"2014-10-31T00:00:00Z","timestamp":1414713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016299","name":"NetApp","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100016299","id-type":"DOI","asserted-by":"crossref"}]},{"name":"APC"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2014,10,31]]},"abstract":"<jats:p>Elastic storage systems can be expanded or contracted to meet current demand, allowing servers to be turned off or used for other tasks. However, the usefulness of an elastic distributed storage system is limited by its agility: how quickly it can increase or decrease its number of servers. Due to the large amount of data they must migrate during elastic resizing, state of the art designs usually have to make painful trade-offs among performance, elasticity, and agility.<\/jats:p>\n          <jats:p>\n            This article describes the state of the art in elastic storage and a new system, called SpringFS, that can quickly change its number of active servers, while retaining elasticity and performance goals. SpringFS uses a novel technique, termed\n            <jats:italic>bounded write offloading<\/jats:italic>\n            , that restricts the set of servers where writes to overloaded servers are redirected. This technique, combined with the read offloading and passive migration policies used in SpringFS, minimizes the work needed before deactivation or activation of servers. Analysis of real-world traces from Hadoop deployments at Facebook and various Cloudera customers and experiments with the SpringFS prototype confirm SpringFS\u2019s agility, show that it reduces the amount of data migrated for elastic resizing by up to two orders of magnitude, and show that it cuts the percentage of active servers required by 67--82%, outdoing state-of-the-art designs by 6--120%.\n          <\/jats:p>","DOI":"10.1145\/2668129","type":"journal-article","created":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T13:18:31Z","timestamp":1415107111000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Agility and Performance in Elastic Distributed Storage"],"prefix":"10.1145","volume":"10","author":[{"given":"Lianghong","family":"Xu","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Cipar","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elie","family":"Krevat","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Tumanov","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Kozuch","sequence":"additional","affiliation":[{"name":"Intel Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory R.","family":"Ganger","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,31]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"AMPLab. 2013. Algorithms Machines People Laboratory Berkley. http:\/\/amplab.cs.berkeley.edu.  AMPLab. 2013. Algorithms Machines People Laboratory Berkley. http:\/\/amplab.cs.berkeley.edu."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807164"},{"volume-title":"The Hadoop Distributed File System: Architecture and Design","author":"Borthakur Dhruba","key":"e_1_2_1_4_1","unstructured":"Dhruba Borthakur . 2007. The Hadoop Distributed File System: Architecture and Design . The Apache Software Foundation . Dhruba Borthakur. 2007. The Hadoop Distributed File System: Architecture and Design. The Apache Software Foundation."},{"volume-title":"Data-intensive supercomputing: The case for DISC. Tech. rep","author":"Bryant Randal E.","key":"e_1_2_1_5_1","unstructured":"Randal E. Bryant . 2007. Data-intensive supercomputing: The case for DISC. Tech. rep ., Carnegie Mellon University . Randal E. Bryant. 2007. Data-intensive supercomputing: The case for DISC. Tech. rep., Carnegie Mellon University."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367519"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2011.12"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2007.4362193"},{"key":"e_1_2_1_12_1","unstructured":"Hadoop. 2012. The Apache Hadoop project. http:\/\/hadoop.apache.org.  Hadoop. 2012. The Apache Hadoop project. http:\/\/hadoop.apache.org."},{"key":"e_1_2_1_13_1","unstructured":"Larry Hardesty. 2012. MIT Intel unveil new initiatives addressing \u2019Big Data\u2019. http:\/\/web.mit.edu\/newsoffice\/2012\/big-data-csail-intel-center-0531.html.  Larry Hardesty. 2012. MIT Intel unveil new initiatives addressing \u2019Big Data\u2019. http:\/\/web.mit.edu\/newsoffice\/2012\/big-data-csail-intel-center-0531.html."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"e_1_2_1_15_1","unstructured":"ISTC-CC. 2013. Intel science and technology center - cloud computing. www.istc-cc.cmu.edu.  ISTC-CC. 2013. Intel science and technology center - cloud computing. www.istc-cc.cmu.edu."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the Workshop on Power-Aware Computing and System HotPower.","author":"Leverich Jacob","year":"2009","unstructured":"Jacob Leverich and Christos Kozyrakis . 2009 . On the energy (in)efficiency of Hadoop clusters . In Proceedings of the Workshop on Power-Aware Computing and System HotPower. Jacob Leverich and Christos Kozyrakis. 2009. On the energy (in)efficiency of Hadoop clusters. In Proceedings of the Workshop on Power-Aware Computing and System HotPower."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934885"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1364813.1364830"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 8th USENIX Symposium on Operating Systems and Implementation (OSD).","author":"Narayanan Dushyanth","year":"2008","unstructured":"Dushyanth Narayanan , Austin Donnelly , Eno Thereska , Sameh Elnikety , and Antony Rowstron . 2008 b. Everest: Scaling down peak loads through I\/O off-loading . In Proceedings of the 8th USENIX Symposium on Operating Systems and Implementation (OSD). Dushyanth Narayanan, Austin Donnelly, Eno Thereska, Sameh Elnikety, and Antony Rowstron. 2008b. Everest: Scaling down peak loads through I\/O off-loading. In Proceedings of the 8th USENIX Symposium on Operating Systems and Implementation (OSD)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1024393.1024400"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966461"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555271.1555281"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1289720.1289721"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2668129","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2668129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:22Z","timestamp":1750227202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2668129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,31]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,10,31]]}},"alternative-id":["10.1145\/2668129"],"URL":"https:\/\/doi.org\/10.1145\/2668129","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2014,10,31]]},"assertion":[{"value":"2014-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}