Comparison of RAID-6 Erasure Codes
暂无分享,去创建一个
[1] Mario Blaum,et al. On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.
[2] Randy H. Katz,et al. A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.
[3] Mario Blaum,et al. New array codes for multiple phased burst correction , 1993, IEEE Trans. Inf. Theory.
[4] Vincent Ricordel,et al. ANALYSIS OF MOJETTE TRANSFORM PROJECTIONS FOR AN EFFICIENT CODING , 2004 .
[5] Benoît Parrein,et al. Multiple Description Coding Using Exact Discrete Radon Transform , 2001, Data Compression Conference.
[6] Lihao Xu,et al. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).
[7] James S. Plank. The RAID-6 Liberation Codes , 2008, FAST.
[8] Luigi Rizzo,et al. Effective erasure codes for reliable computer communication protocols , 1997, CCRV.
[9] Jehoshua Bruck,et al. EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.
[10] Jean-Pierre V. Guédon,et al. The Mojette Transform: The First Ten Years , 2005, DGCI.
[11] Catherine D. Schuman,et al. A Performance Evaluation and Examination of Open-Source Erasure Coding Libraries for Storage , 2009, FAST.
[12] James S. Plank,et al. The Raid-6 Liber8Tion Code , 2009, Int. J. High Perform. Comput. Appl..
[13] Peter F. Corbett,et al. Row-Diagonal Parity for Double Disk Failure Correction (Awarded Best Paper!) , 2004, USENIX Conference on File and Storage Technologies.
[14] Jianzhong Huang,et al. Two Efficient Partial-Updating Schemes for Erasure-Coded Storage Clusters , 2012, 2012 IEEE Seventh International Conference on Networking, Architecture, and Storage.