Rotary-code: Efficient MDS array codes for RAID-6 disk arrays

Authors:
Yulin Wang;Guangjun Li
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China
Venue:
WSEAS Transactions on Computers
Year:
2009

Citing 13
Cited 0

A case for redundant arrays of inexpensive disks (RAID)

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures

IEEE Transactions on Computers - Special issue on fault-tolerant computing
A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems

Software—Practice & Experience
Note: Correction to the 1997 tutorial on Reed–Solomon coding

Software—Practice & Experience - Research Articles
New Efficient MDS Array Codes for RAID Part I: Reed-Solomon-Like Codes for Tolerating Three Disk Failures

IEEE Transactions on Computers
Awarded Best Paper! -- Row-Diagonal Parity for Double Disk Failure Correction

FAST '04 Proceedings of the 3rd USENIX Conference on File and Storage Technologies
Hydra: a platform for survivable and secure data storage systems

Proceedings of the 2005 ACM workshop on Storage security and survivability
HoVer Erasure Codes For Disk Arrays

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
WEAVER codes: highly fault tolerant erasure codes for storage systems

FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
The RAID-6 liberation codes

FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
STAR: An Efficient Coding Scheme for Correcting Triple Storage Node Failures

IEEE Transactions on Computers
X-code: MDS array codes with optimal encoding

IEEE Transactions on Information Theory
Low-density MDS codes and factors of complete graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Low encoding/decoding complexity is essential for practical RAID-6 storage systems. In this paper, we describe a new coding scheme, which we call Rotary-code, for RAID-6 disk arrays. We construct Rotary-code based on a bit matrix-vector product similar to the Reed-Solomon coding, and provide the geometry encoding method and detailed non-recursive decoding algorithms. The capability of two-disk fault-tolerance and the property of Maximum Distance Separable (MDS) are proved in Rotary-code. The key novelty in Rotary-code is that the Rotary-code has optimal encoding complexity and optimal decoding complexity comparing with existing RAID-6 codes.