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.
- Michael H. Anderson. 2002. Dynamic expansion of storage device array. (2002). Patent No. US6442649, Filed Aug. 18, 1999, Issued Aug. 27, 2002.Google Scholar
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- IDC. 2012. The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East. Technical report. International Data Corporation.Google Scholar
- 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. Google Scholar
Digital Library
- Jeffrey Katcher. 1997. PostMark: A New File System Benchmark. Technical report TR-3022. NetApp, Inc.Google Scholar
- 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. Google Scholar
Digital Library
- Edward K. Lee and Randy H. Katz. 1993. The performance of parity placements in disk arrays. IEEE Trans. Comput. 42, 6 (1993), 651--664. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Jai Menon and Dick Mattson. 1992. Distributed sparing in disk arrays. In Proceedings of the 37th International Conference on COMPCON (COMPCON’92). 410--421. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Cross Ref
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- David A. Patterson et al. 2002. A simple way to estimate the cost of downtime. In LISA, Vol. 2. 185--188. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- SPC traces. 2007. Storage Performance Council. Retrieved from http://www.storageperformance.org/home.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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). Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
Index Terms
H-Scale: A Fast Approach to Scale Disk Arrays via Hybrid Stripe Deployment
Recommendations
HPDA: A hybrid parity-based disk array for enhanced performance and reliability
Flash-based Solid State Drive (SSD) has been productively shipped and deployed in large scale storage systems. However, a single flash-based SSD cannot satisfy the capacity, performance and reliability requirements of the modern storage systems that ...
Design and Evaluation of a New Approach to RAID-0 Scaling
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 ...
Higher reliability redundant disk arrays: Organization, operation, and coding
Parity is a popular form of data protection in redundant arrays of inexpensive/independent disks (RAID). RAID5 dedicates one out of N disks to parity to mask single disk failures, that is, the contents of a block on a failed disk can be reconstructed by ...






Comments