HCS: Expanding H-Code RAID 6 without Recalculating Parity Blocks in Big Data Circumstance

This paper introduces a new RAID 6 expanding method HCS, which is facing the circumstance of big data. HCS expands H-Code manner RAID 6. Two key techniques are used to avoid parity blocks’ recalculating. The first one is anti-diagonal data blocks’ selection, and the other one is horizontal data migration. These two techniques ensure the data blocks are retained in the same verification zone, that is horizontal verification zone and anti-diagonal verification zone. Experimental results showed that, compared with SDM, which is also a fast expansion method, HCS can reduce 3.6% expansion time and promote 4.62% performance under four traces.

[1]  Peter F. Corbett,et al.  Awarded Best Paper! -- Row-Diagonal Parity for Double Disk Failure Correction , 2004 .

[2]  Mario Blaum,et al.  On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.

[3]  Yifeng Zhu,et al.  A New Parity-Based Migration Method to Expand RAID-5 , 2014, IEEE Transactions on Parallel and Distributed Systems.

[4]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[5]  James S. Plank The RAID-6 Liberation Codes , 2008, FAST.

[6]  Toni Cortes,et al.  Increasing the capacity of RAID5 by online gradual assimilation , 2004, SNAPI '04.

[7]  Chentao Wu,et al.  SDM: A Stripe-Based Data Migration Scheme to Improve the Scalability of RAID-6 , 2012, 2012 IEEE International Conference on Cluster Computing.

[8]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[9]  Hong Jiang,et al.  P-Code: a new RAID-6 code with optimal properties , 2009, ICS '09.

[10]  Jehoshua Bruck,et al.  Cyclic Lowest Density MDS Array Codes , 2009, IEEE Transactions on Information Theory.

[11]  Chentao Wu,et al.  HDP code: A Horizontal-Diagonal Parity Code to Optimize I/O load balancing in RAID-6 , 2011, 2011 IEEE/IFIP 41st International Conference on Dependable Systems & Networks (DSN).

[12]  Antony I. T. Rowstron,et al.  Write off-loading: Practical power management for enterprise storage , 2008, TOS.

[13]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[14]  Jehoshua Bruck,et al.  Low density MDS codes and factors of complete graphs , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[15]  Weimin Zheng,et al.  FastScale: Accelerate RAID Scaling by Minimizing Data Migration , 2011, FAST.

[16]  Jehoshua Bruck,et al.  X-Code: MDS Array Codes with Optimal Encoding , 1999, IEEE Trans. Inf. Theory.

[17]  Jiwu Shu,et al.  SLAS: An efficient approach to scaling round-robin striped volumes , 2007, TOS.

[18]  Ajay Dholakia,et al.  A new intra-disk redundancy scheme for high-reliability RAID storage systems in the presence of unrecoverable errors , 2006, TOS.

[19]  Garth A. Gibson,et al.  RAID: high-performance, reliable secondary storage , 1994, CSUR.

[20]  Jiwu Shu,et al.  ALV: A New Data Redistribution Approach to RAID-5 Scaling , 2010, IEEE Transactions on Computers.

[21]  Chentao Wu,et al.  H-Code: A Hybrid MDS Array Code to Optimize Partial Stripe Writes in RAID-6 , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.