{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:17Z","timestamp":1763468177074,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2013AA01A210","2014CB340402"],"award-info":[{"award-number":["2013AA01A210","2014CB340402"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60903183, 61170008, 61272055"],"award-info":[{"award-number":["60903183, 61170008, 61272055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>Scaling up a RAID-0 volume with added disks can increase its storage capacity and I\/O bandwidth simultaneously. For preserving a round-robin data distribution, existing scaling approaches require all the data to be migrated. Such large data migration results in a long redistribution time as well as a negative impact on application performance. In this article, we present a new approach to RAID-0 scaling called FastScale. First, FastScale minimizes data migration, while maintaining a uniform data distribution. It moves only enough data blocks from old disks to fill an appropriate fraction of new disks. Second, FastScale optimizes data migration with access aggregation and lazy checkpoint. Access aggregation enables data migration to have a larger throughput due to a decrement of disk seeks. Lazy checkpoint minimizes the number of metadata writes without compromising data consistency. Using several real system disk traces, we evaluate the performance of FastScale through comparison with SLAS, one of the most efficient existing scaling approaches. The experiments show that FastScale can reduce redistribution time by up to 86.06% with smaller application I\/O latencies. The experiments also illustrate that the performance of RAID-0 scaled using FastScale is almost identical to, or even better than, that of the round-robin RAID-0.<\/jats:p>","DOI":"10.1145\/2491054","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T13:28:12Z","timestamp":1386682092000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Design and Evaluation of a New Approach to RAID-0 Scaling"],"prefix":"10.1145","volume":"9","author":[{"given":"Guangyan","family":"Zhang","sequence":"first","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weimin","family":"Zheng","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keqin","family":"Li","sequence":"additional","affiliation":[{"name":"State University of New York and Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Alemany J. and Thathachar J. S. 1997. Random striping news on demand servers. Tech. rep. TR-97-02-02 University of Washington.  Alemany J. and Thathachar J. S. 1997. Random striping news on demand servers. Tech. rep. TR-97-02-02 University of Washington."},{"key":"e_1_2_1_2_1","unstructured":"Brigham Young University. 2010. TPC-C Postgres 20 iterations. DTB v1.1. Performance Evaluation Laboratory Trace distribution center. http:\/\/tds.cs.byu.edu\/tds\/.  Brigham Young University. 2010. TPC-C Postgres 20 iterations. DTB v1.1. Performance Evaluation Laboratory Trace distribution center. http:\/\/tds.cs.byu.edu\/tds\/."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/341800.341815"},{"key":"e_1_2_1_4_1","unstructured":"Brown N. 2006. Online RAID-5 resizing. drivers\/md\/ raid5.c in the source code of Linux Kernel 2.6.18. http:\/\/www.kernel.org\/.  Brown N. 2006. Online RAID-5 resizing. drivers\/md\/ raid5.c in the source code of Linux Kernel 2.6.18. http:\/\/www.kernel.org\/."},{"key":"e_1_2_1_5_1","unstructured":"Bucy J. Schindler J. Schlosser S. and Ganger G. 2008. The DiskSim Simulation Environment Version 4.0 Reference Manual. Tech. rep. CMU-PDL-08-101 Carnegie Mellon University.  Bucy J. Schindler J. Schlosser S. and Ganger G. 2008. The DiskSim Simulation Environment Version 4.0 Reference Manual. Tech. rep. CMU-PDL-08-101 Carnegie Mellon University."},{"key":"e_1_2_1_6_1","first-page":"997","article-title":"Expansion of RAID subsystems using spare space with immediate access to new space","volume":"10","author":"Franklin C. R.","year":"2006","journal-title":"US Patent"},{"volume-title":"Proceedings of the 18th International Conference on Data Engineering (ICDE). 473--482","author":"Goel A.","key":"e_1_2_1_7_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1162628.1162631"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1784707.1784715"},{"key":"e_1_2_1_10_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J.","year":"2003","edition":"3"},{"key":"e_1_2_1_11_1","unstructured":"Hetzler S. R. 2008. Data storage array scaling method and system with minimal data movement. US Patent 20080276057.  Hetzler S. R. 2008. Data storage array scaling method and system with minimal data movement. US Patent 20080276057."},{"volume-title":"Hard disk drive specifications Ultrastar 36Z15","author":"Hitachi","key":"e_1_2_1_12_1"},{"volume-title":"Proceedings of the 17th International Parallel and Distributed Processing Symposium.","author":"Honicky R. J.","key":"e_1_2_1_13_1"},{"volume-title":"Proceedings of the 18th International Parallel and Distributed Processing Symposium.","author":"Honicky R. J.","key":"e_1_2_1_14_1"},{"volume-title":"Proceedings of the 8th International Conference on Parallel and Distributed Systems (ICPADS). 500--505","author":"Kim C.","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","unstructured":"Legg C. B. 1999. Method of increasing the storage capacity of a level five RAID disk array by adding in a single step a new parity block and N-1 new data blocks which respectively reside in new columns where N is at least two. US Patent: 6000010 December 1999.  Legg C. B. 1999. Method of increasing the storage capacity of a level five RAID disk array by adding in a single step a new parity block and N-1 new data blocks which respectively reside in new columns where N is at least two. US Patent: 6000010 December 1999."},{"key":"e_1_2_1_17_1","unstructured":"Muller K. and Vignaux T. 2009. SimPy 2.0.1 documentation. http:\/\/simpy.sourceforge.net\/SimPyDocs\/index.html.  Muller K. and Vignaux T. 2009. SimPy 2.0.1 documentation. http:\/\/simpy.sourceforge.net\/SimPyDocs\/index.html."},{"volume-title":"Proceedings of the 16th Large Installation Systems Administration Conference (LISA). 185--188","year":"2002","author":"Patterson D. A.","key":"e_1_2_1_18_1"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/50202.50214"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/345063.339352"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1084779.1084781"},{"volume-title":"Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST).","author":"Sivathanu M.","key":"e_1_2_1_22_1"},{"key":"e_1_2_1_23_1","unstructured":"Storage Performance Council. 2010. http:\/\/www.storageperformance.org\/home.  Storage Performance Council. 2010. http:\/\/www.storageperformance.org\/home."},{"key":"e_1_2_1_24_1","unstructured":"UMass Trace Repository. 2007. OLTP Application I\/O and Search Engine I\/O. http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage.  UMass Trace Repository. 2007. OLTP Application I\/O and Search Engine I\/O. http:\/\/traces.cs.umass.edu\/index.php\/Storage\/Storage."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1188455.1188582"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/225535.225539"},{"volume-title":"Proceedings of the 7th USENIX Conference on File and Storage Technologies (FAST). 239--252","author":"Wu S. J.","key":"e_1_2_1_27_1"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227835.1227838"},{"volume-title":"Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST).","author":"Zheng W. M.","key":"e_1_2_1_29_1"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491054","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:30Z","timestamp":1750234710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1145\/2491054"],"URL":"https:\/\/doi.org\/10.1145\/2491054","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"2012-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}