|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2010 IEEE/IFIP International Conference on Dependable Systems&Networks (DSN)
Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems
Chicago, IL, USA
June 28-July 01
ISBN: 978-1-4244-7500-1
| ASCII Text | x | ||
| Shenggang Wan, Qiang Cao, Changsheng Xie, Ben Eckart, Xubin He, "Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems," IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012), pp. 51-60, 2010 IEEE/IFIP International Conference on Dependable Systems&Networks (DSN), 2010. | |||
| BibTex | x | ||
| @article{ 10.1109/DSN.2010.5545009, author = { Shenggang Wan and Qiang Cao and Changsheng Xie and Ben Eckart and Xubin He}, title = {Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems}, journal ={IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012)}, volume = {0}, year = {2010}, isbn = {978-1-4244-7500-1}, pages = {51-60}, doi = {http://doi.ieeecomputersociety.org/10.1109/DSN.2010.5545009}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) TI - Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems SN - 978-1-4244-7500-1 SP51 EP60 A1 - Shenggang Wan, A1 - Qiang Cao, A1 - Changsheng Xie, A1 - Ben Eckart, A1 - Xubin He, PY - 2010 VL - 0 JA - IEEE/IFIP International Conference on Dependable Systems and Networks (DSN 2012) ER - | |||
In this paper, we present a novel coding scheme that can tolerate up to two-disk failures, satisfying the RAID-6 property. Our coding scheme, Code-M, is a non-MDS (Maximum Distance Separable, tolerating maximum failures with a given amount of redundancy) code that is optimized by trading rate for fast recovery times. Code-M is lowest density and its parity chain length is fixed at 2C − 1 for a given number of columns in a strip-set C. The rate of Code-M, or percentage of disk space occupied by non-parity data, is (C − 1)/C. We perform theoretical analysis and evaluation of the coding scheme under different configurations. Our theoretical analysis shows that Code-M has favorable reconstruction times compared to RDP, another well-established RAID-6 code. The quantitative comparisons of Code-M against RDP demonstrate recovery performance improvement by a factor of up to 5.18 under single disk failure and 2.8 under double failures using the same number of disks. Overall, Code-M is a RAID-6 type code supporting fast recovery with reduced I/O complexity.
Citation:
Shenggang Wan, Qiang Cao, Changsheng Xie, Ben Eckart, Xubin He, "Code-M: A non-MDS erasure code scheme to support fast recovery from up to two-disk failures in storage systems," dsn, pp.51-60, 2010 IEEE/IFIP International Conference on Dependable Systems&Networks (DSN), 2010
Usage of this product signifies your acceptance of the Terms of Use.
