Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Patterson, D., Katz, G.R.: A case for redundant arrays of inexpensive disks(raid). In: Proceeding of the SIGMOD 1988 (1988)
Peter, M., Chen, E.K.L.: Raid: High-performance, reliable secondary storage. ACM Computing Surveys 26, 145–185 (1994)
Wu, C., Wan, S.: H-code: A hybrid mds array code to optimize partial stripe writes in raid-6. In: Parallel and Distributed Processing Symposium (IPDPS), pp. 782–793 (2011)
Jin, C., Jiang, H.: P-code: A new raid-6 code with optimal properties. In: Proceedings of the 23rd International Conference on Supercomputing, pp. 360–369 (2009)
Cassuto, Y., Bruck, J.: Cyclic lowest density mds array codes. IEEE Trans. on Information Theory 55, 1721–1729 (2009)
Wu, C., He, X., Wu, G.: HDP code: A horizontal-diagonal parity code to optimize i/o load balancing in raid-6. In: Proceeding of the DSN 2011 (2011)
Xu, L., Bruck, J.: X-code: Mds array codes with optimal encoding. IEEE Trans. on Information Theory 45, 272–276 (1999)
Xu, L., Bruck, J.: Low-density mds codes and factors of complete graphs. IEEE Trans. on Information Theory 45, 1817–1826 (1999)
Corbett, P., English, B., Goel, A.: Row-diagonal parity for double disk failure correction. In: Proceedings of the 3rd USENIX Conference on File and Storage Technologies (2004), pp. 1–14 (2004)
Blaum, M., Brandy, J., Bruck, J.: Evenodd: An efficient scheme for tolerating double disk failure in raid architectures. IEEE Trans. on Computers 44, 192–202 (1995)
Blaum, M., Roth, R.: On lowest density mds codes. IEEE Trans. on Information Theory 45, 46–59 (1999)
Reed, I., Solomon, G.: Polynomial codes over certain finite fields. J. of the Society for Indus. and Applied Math., 300–304 (1960)
Plank, J.: The raid-6 liberation codes. In: Proc. of the FAST 2008 (2008)
Brown, N.: Online RAID-5 Resizing. Drivers/md/raid5.c in the source code of Linux Kernel 2.6.18, http://www.kernel.org/ (September 2006)
Gonzalez, J.L., Cortes, T.: Increasing the capacity of raid5 by online gradual assimilation. In: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI 2004, pp. 17–24 (2004)
Blaum, M., Brandy, J., Bruck, J.: Slas: An efficient approach to scaling round-robin striped volumes. ACM Transactions on Storage 3 (2007)
Zhang, G., Zheng, W., Shu, J.: Alv: A new data redistribution approach to raid-5 scaling. IEEE Transactions on Computers 59, 345–357 (2010)
Zheng, W., Zhang, G.: Fastscale: accelerate raid scaling by minimizing data migration. In: Proceedings of the 19th USENIX conference on File and Storage Technologies (2011)
Mao, Y., Wan, J., Zhu, Y., Xie, C.: A new parity-based migration method to expand raid-5. IEEE Transactions on Parallel and Distributed Systems 25, 1945–1954 (2014)
Legg, C.B.: 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 columns (December 1999)
Corbett, P.F., Kleiman, S.R., English, R.M.: Semi-static distribution technique, US Patent 7,185,144 (February 2007)
Wu, C., He, X., Han, J., Tan, H.: Sdm: A stripe-based data migration scheme to improve the scalability of raid-6. In: 2012 IEEE International Conference on Cluster Computing (CLUSTER), pp. 284–292 (2012)
Jin, C., Jiang, H., Feng, D., Tian, L.: P-code: A new raid-6 code with optimal properties. In: Proceedings of the 23rd International Conference on Supercomputing (2009)
Corbett, P., English, B., Goel, A.: Row-diagonal parity for double disk failure correction. In: Proceedings of the 3rd USENIX Conference on File and Storage Technologies, pp. 1–14 (2004)
(DiskSim) University of Michigan and Carnegie Mellon University, http://www.pdl.cmu.edu/DiskSim
Narayanan, D., Donnelly, A., Rowstron, A.: Write offloading: Practical power manage-ment for enterprise storage. ACM Transactions on Storage 4, 1–23 (2008)
(SNIA) Storage Networking Industry Association,FIU-Home2 block I/O trace (2010), http://iotta.snia.org/traces/414
(Storage) Financial1.spc and Financial2.spc., http://traces.cs.umass.edu/index.php/Storage/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, S., Mao, Y., Tan, M., Jing, W. (2015). HCS: Expanding H-Code RAID 6 without Recalculating Parity Blocks in Big Data Circumstance. In: Wang, H., et al. Intelligent Computation in Big Data Era. ICYCSEE 2015. Communications in Computer and Information Science, vol 503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46248-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-662-46248-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46247-8
Online ISBN: 978-3-662-46248-5
eBook Packages: Computer ScienceComputer Science (R0)