Candidate MDS Array Codes for Tolerating Three Disk Failures in RAID-7 Architectures

被引:0
作者
Punekar, Mayur [1 ]
Malluhi, Qutaibah [1 ]
Wang, Yongge [2 ]
Desmedt, Yvo [3 ]
机构
[1] Qatar Univ, Dept Comp Sci & Engn, Doha, Qatar
[2] UNC Charlotte, Dept SIS, Charlotte, NC USA
[3] Univ Texas Dallas, Richardson, TX 75083 USA
来源
BDCAT'17: PROCEEDINGS OF THE FOURTH IEEE/ACM INTERNATIONAL CONFERENCE ON BIG DATA COMPUTING, APPLICATIONS AND TECHNOLOGIES | 2017年
关键词
RAID-7; MDS Array codes; Three-Column-Erasure Tolerating Codes;
D O I
10.1145/3148055.3148056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Current storage systems use RAID-5 and RAID-6 architectures to provide protection against one and two disk failures, respectively. However, as the size of storage system grows rapidly three concurrent disk failures are becoming more frequent. To cope up with three disk failure, we propose a new RAID level, i.e., RAID-7, for which three-column-erasure tolerating MDS array codes are needed. However, it is an open question as to which MDS array codes should be used for RAID-7. In this paper, we compare different array codes, which can be used in RAID-7 systems that require storage efficiency (the ratio of number of information symbols to encoding (or codeword) symbols) <= 0.5. The paper discusses three column-erasure tolerating MDS array codes proposed in the literature namely, [5,2] 2 x 5 BP-XOR code, [6,3] 4 x 6 lowest-density array code, [6,3] 2x6 STAR code, [6, 3] 4x6 generalized RDP code. The paper introduces a new three-column-erasure tolerating [6,3] 2 x 6 almost BP-XOR codes. We analyze annual failure rate, storage efficiency, worst case normalized encoding/update/repairing/read complexity, repair bandwidth, and number of buffers required for these codes. We also provide experimental results to understand the average case encoding and repairing complexity of BP-XOR, STAR, GRDP, and almost BP-XOR codes by implementing them in software. From our analysis and experimental results, we conclude that [6,3] 2 x 6 almost BP-XOR are best suited for RAID-7 systems with storage efficiency <= 0.5.
引用
收藏
页码:33 / 42
页数:10
相关论文
共 27 条
[1]  
[Anonymous], 2003, P 19 ACM S OP SYST P, DOI [10.1145/1165389.945450, DOI 10.1145/1165389.945450]
[2]   EVENODD - AN EFFICIENT SCHEME FOR TOLERATING DOUBLE-DISK FAILURES IN RAID ARCHITECTURES [J].
BLAUM, M ;
BRADY, J ;
BRUCK, J ;
MENON, J .
IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (02) :192-202
[3]   NEW ARRAY CODES FOR MULTIPLE PHASED BURST CORRECTION [J].
BLAUM, M ;
ROTH, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (01) :66-77
[4]   On lowest density MDS codes [J].
Blaum, M ;
Roth, RM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (01) :46-59
[5]   MDS array codes with independent parity symbols [J].
Blaum, M ;
Bruck, J ;
Vardy, A .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :529-542
[6]   A family of MDS array codes with minimal number of encoding operations [J].
Blaum, Mario .
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, :2784-2788
[7]  
Chao Jin, 2011, Proceedings of the 2011 6th IEEE International Conference on Networking, Architecture, and Storage (NAS 2011), P102, DOI 10.1109/NAS.2011.31
[8]  
Corbett P, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE 3RD USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES, P1
[9]   Network Coding for Distributed Storage Systems [J].
Dimakis, Alexandros G. ;
Godfrey, P. Brighten ;
Wu, Yunnan ;
Wainwright, Martin J. ;
Ramchandran, Kannan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) :4539-4551
[10]  
Ford D., 2010, P 9 USENIX C OP SYST, P61