skip to main content
research-article
Public Access

H-Scale: A Fast Approach to Scale Disk Arrays via Hybrid Stripe Deployment

Published: 29 April 2016 Publication History

Abstract

To satisfy the explosive growth of data in large-scale data centers, where redundant arrays of independent disks (RAIDs), especially RAID-5, are widely deployed, effective storage scaling and disk expansion methods are desired. However, a way to reduce the data migration overhead and maintain the reliability of the original RAID are major concerns of storage scaling. To address these problems, we propose a new RAID scaling scheme, H-Scale, to achieve fast RAID scaling via hybrid stripe layouts. H-Scale takes advantage of the loose restriction of stripe structures to choose migrated data and to create hybrid stripe structures. The main advantages of our scheme include: (1) dramatically reducing the data migration overhead and thus speeding up the scaling process, (2) maintaining the original RAID’s reliability, (3) balancing the workload among disks after scaling, and (4) providing a general scaling approach for different RAID levels. Our theoretical analysis show that H-Scale outperforms existing scaling solutions in terms of data migration, I/O overheads, and parity update operations. Evaluation results on a prototype implementation demonstrate that H-Scale speeds up the online scaling process by up to 60% under SPC traces, and similar improvements on scaling time and user response time are also achieved by evaluations using standard benchmarks.

References

[1]
Michael H. Anderson. 2002. Dynamic expansion of storage device array. (2002). Patent No. US6442649, Filed Aug. 18, 1999, Issued Aug. 27, 2002.
[2]
Yitzhak Birk. 1997. Random RAIDs with selective exploitation of redundancy for high performance video servers. In Proceedings of the 7th International Workshop on Network and Operating System Support for Digital Audio and Video. 13--23.
[3]
André Brinkmann, Sascha Effert, C Scheideler, and others. 2007. Dynamic and redundant data placement. In Distributed Computing Systems, 2007. ICDCS’07. 27th International Conference on. IEEE, 29--29.
[4]
André Brinkmann, Kay Salzwedel, and Christian Scheideler. 2000. Efficient, distributed data placement strategies for storage area networks. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’00). ACM, New York, NY, 119--128.
[5]
Neil Brown. 2007. Online RAID-5 resizing. drivers/md/ raid5.c in the source code of Linux Kernel 2.6.23. (2007). http://neil.brown.name/blog/mdadm.
[6]
Harold W. Cain, Ravi Rajwar, Morris Marden, and Mikko H. Lipasti. 2001. An architectural evaluation of Java TPC-W. In The 7th International Symposium on High-Performance Computer Architecture (HPCA’ 01). 229--240.
[7]
David Mun-Hien Choy and Jaishankar Moothedath Menon. 1998. Methods and data storage devices for RAID expansion by on-line addition of on-line addition of new DASDs. (1998). Patent No. US5758118, Filed Dec. 8, 1995, Issued May 26, 1998.
[8]
Peter Corbett, Bob English, Atul Goel, Tomislav Grcanac, Steven Kleiman, James Leong, and Sunitha Sankar. 2004. Row-diagonal parity for double disk failure correction. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies (FAST’04). 1--14.
[9]
Chris R. Franklin and Jeffrey T. Wong. 2006. Expansion of RAID subsystems using spare space with immediate access to new space. (2006). Patent No. US7111117, Filed Dec. 19, 2001, Issued Sep. 19, 2006.
[10]
Garth A. Gibson, David F. Nagle, William Courtright II, Nat Lanza, Paul Mazaitis, Marc Unangst, and Jim Zelenka. 1999. NASD scalable storage systems. In Proceedings of the USENIX 1999 Extreme Linux Workshop.
[11]
Ashish Goel, Cyrus Shahabi, Shu-yuen Didi Yao, and Roger Zimmermann. 2002. SCADDAR: An efficient randomized technique to reorganize continuous media blocks. In Proceedings of the 18th International Conference on Data Engineering. 473--482.
[12]
Jose Luis Gonzalez and Toni Cortes. 2004. Increasing the capacity of RAID5 by online gradual assimilation. In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI’04). 17--24.
[13]
Steven Robert Hetzler. 2012. Data Storage Array Scaling Method and System with Minimal Data Movement. (2012). Patent No. US8239622, Filed Jun. 5, 2008, Issued Aug. 7, 2012.
[14]
Mark Holland and Garth A. Gibson. 1992. Parity declustering for continuous operation in redundant disk arrays. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ALPLOS’92). 23--35.
[15]
J. Huang, X. Liang, X. Qin, P. Xie, and C. Xie. 2014. Scale-RS: An efficient scaling scheme for RS-coded storage clusters. IEEE Transactions on Parallel and Distributed Systems 26, 6 (2015), 1704--1717.
[16]
IDC. 2012. The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East. Technical report. International Data Corporation.
[17]
Chao Jin, Hong Jiang, Dan Feng, and Lei Tian. 2009. P-Code: A new RAID-6 code with optimal properties. In Proceedings of the 23rd International Conference on Supercomputing (ICS’09). 360--369.
[18]
Jeffrey Katcher. 1997. PostMark: A New File System Benchmark. Technical report TR-3022. NetApp, Inc.
[19]
Jan Korst. 1997. Random duplicated assignment: An alternative to striping in video servers. In Proceedings of the 5th ACM International Conference on Multimedia (MULTIMEDIA’97). 219--226.
[20]
Edward K. Lee and Randy H. Katz. 1993. The performance of parity placements in disk arrays. IEEE Trans. Comput. 42, 6 (1993), 651--664.
[21]
Christopher B. Legg and Calif Oceanside. 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 a new colums, where N is at least two. (1999). Patent No. US6000010, Filed May 9, 1997, Issued Dec. 7, 1999.
[22]
Scott T. Leutenegger and Daniel Dias. 1993. A modeling study of the TPC-C benchmark. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD’93). 22--31.
[23]
Diego R. Llanos. 2006. TPCC-UVa: An open-source TPC-C implementation for global performance measurement of computer systems. SIGMOD Rec. 35, 4 (Dec. 2006), 6--15.
[24]
Jai Menon and Dick Mattson. 1992. Distributed sparing in disk arrays. In Proceedings of the 37th International Conference on COMPCON (COMPCON’92). 410--421.
[25]
Alberto Miranda, Sascha Effert, Yangwook Kang, Ethan L. Miller, Andre Brinkmann, and Toni Cortes. 2011. Reliable and randomized data distribution strategies for large scale storage systems. In High Performance Computing (HiPC), 2011 18th International Conference on. IEEE, Washington, DC, 1--10.
[26]
Richard Muntz, Jose Renato Santos, and Steven Berson. 1998. A parallel disk storage system for realtime multimedia applications. Int. J. Intell. Syst. 13, 12 (1998), 1137--1147.
[27]
Nitin Muppalaneni and K. Gopinath. 2000. A multi-tier RAID storage system with RAID1 and RAID5. In Proceedings of the 14th International Parallel and Distributed Processing Symposium (IPDPS’00). 663--671.
[28]
David Nagle, Denis Serenyi, and Abbie Matthews. 2004. The panasas activescale storage cluster: Delivering scalable high bandwidth storage. In Proceedings of the 2004 ACM/IEEE conference on Supercomputing (SC’04). ACM, New York, NY.
[29]
David A. Patterson et al. 2002. A simple way to estimate the cost of downtime. In LISA, Vol. 2. 185--188.
[30]
David A. Patterson, Garth Gibson, and Randy H. Katz. 1988. A case for redundant arrays of inexpensive disks (RAID). In Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data (SIGMOD’88). ACM, New York, NY, 109--116.
[31]
Kenneth Salem and Hector Garcia-Molina. 1986. DISK STRIPIN G T. In International Conference on Data Engineering, February 5--7, 1986, Bonaventure Hotel, Los Angeles, California, USA. IEEE Computer Society Press, Washington, DC, 336.
[32]
Scott Schoenthal, Sunitha S. Sankar, and Loellyn J. Cassell. 2010. Technique for managing addition of disks to a volume of a storage system. (2010). Patent No. US7694173, Filed Aug. 22, 2008, Issued Apr. 6, 2010.
[33]
SPC traces. 2007. Storage Performance Council. Retrieved from http://www.storageperformance.org/home.
[34]
Sage A. Weil, Scott A. Brandt, Ethan L. Miller, Darrell D. E. Long, and Carlos Maltzahn. 2006. Ceph: A scalable, high-performance distributed file system. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation (OSDI’06). 307--320.
[35]
Brent Welch, Marc Unangst, Zainul Abbasi, Garth A. Gibson, Brian Mueller, Jason Small, Jim Zelenka, and Bin Zhou. 2008. Scalable performance of the Panasas parallel file system. In Proceedings of the 6th USENIX Conference on File and Storage Technologies (FAST’08). 17--33.
[36]
John Wilkes, Richard Golding, Carl Staelin, and Tim Sullivan. 1996. The HP AutoRAID hierarchical storage system. ACM Transactions on Computer Systems 14, 1 (1996), 108--136.
[37]
Chentao Wu and Xubin He. 2012. GSR: A global stripe-based redistribution approach to accelerate RAID-5 scaling. In Proceedings of the 41st International Conference on Parallel Processing (ICPP’12). 460--469.
[38]
Chentao Wu, Xubin He, Jizhong Han, Huailiang Tan, and Changsheng Xie. 2012. SDM: A stripe-based data migration scheme to improve the scalability of RAID-6. In Proceedings of the 2012 IEEE International Conference on Cluster Computing (CLUSTER’12). 284--292.
[39]
Qin Xin, Ethan L. Miller, Thomas Schwarz S. J., Darrell D. E. Long, Scott A. Brandt, and Witold Litwin. 2003. Reliability mechanisms for very large storage systems. In Proceedings of the 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies (MSST’03). 146--156.
[40]
Guangyan Zhang, Jiwu Shu, Wei Xue, and Weimin Zheng. 2007. SLAS: An efficient approach to scaling round-robin striped volumes. ACM Trans. Stor. 3, 1 (2007).
[41]
Guangyan Zhang, Weimin Zheng, and Keqin Li. 2013. Design and evaluation of a new approach to RAID-0 scaling. ACM Trans. Stor. 9, 4 (2013), 11.
[42]
Guangyan Zhang, Weimin Zheng, and Jiwu Shu. 2010. ALV: A new data redistribution approach to RAID-5 scaling. IEEE Trans. Comput. 59, 3 (2010), 345--357.
[43]
Weimin Zheng and Guangyan Zhang. 2011. FastScale: Accelerate RAID scaling by minimizing data migration. In Proceedings of the 9th USENIX Conference on File and Storage Technologies (FAST’11). 149--161.

Cited By

View all
  • (2024)Achieving Tunable Erasure Coding with Cluster-Aware Redundancy TransitioningACM Transactions on Architecture and Code Optimization10.1145/367207721:3(1-24)Online publication date: 10-Jun-2024
  • (2024)Storage ReliabilityData Storage Architectures and Technologies10.1007/978-981-97-3534-1_9(225-270)Online publication date: 28-Aug-2024
  • (2019)Accelerate RAID scaling by reducing disk I/Os and XOR operationsProceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications10.1145/3318265.3318266(63-66)Online publication date: 8-Mar-2019
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Storage
ACM Transactions on Storage  Volume 12, Issue 3
June 2016
237 pages
ISSN:1553-3077
EISSN:1553-3093
DOI:10.1145/2932205
Issue’s Table of Contents
© 2016 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 April 2016
Accepted: 01 September 2015
Revised: 01 July 2015
Received: 01 May 2014
Published in TOS Volume 12, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. RAID
  2. RAID scaling
  3. hybrid stripe

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

  • National Natural Science Foundation of China
  • Director Fund of WNLO
  • Key Laboratory of Data Storage System
  • Ministry of Education
  • U.S. National Science Foundation
  • Fundamental Research Funds for the Central Universities HUST

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)80
  • Downloads (Last 6 weeks)13
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Achieving Tunable Erasure Coding with Cluster-Aware Redundancy TransitioningACM Transactions on Architecture and Code Optimization10.1145/367207721:3(1-24)Online publication date: 10-Jun-2024
  • (2024)Storage ReliabilityData Storage Architectures and Technologies10.1007/978-981-97-3534-1_9(225-270)Online publication date: 28-Aug-2024
  • (2019)Accelerate RAID scaling by reducing disk I/Os and XOR operationsProceedings of the 3rd International Conference on High Performance Compilation, Computing and Communications10.1145/3318265.3318266(63-66)Online publication date: 8-Mar-2019
  • (2019)A Fast Approach to Scale Up Disk Arrays With Parity Declustered Data Layout by Minimizing Data MigrationIEEE Access10.1109/ACCESS.2019.28962637(23967-23989)Online publication date: 2019

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media