RAIDq: A software-friendly, multiple-parity RAID

Ming Shing Chen, Bo Yin Yang, Chen Mou Cheng

Research output: Contribution to conferenceConference Paperpeer-review

2 Scopus citations

Abstract

As disk manufacturers compete to build ever larger and cheaper disks, the possibility of RAID failures becomes more significant for larger and larger disk arrays, creating opportunities for products beyond RAID 6. In this paper, we present the design and implementation of RAIDq, a software-friendly, multiple-parity RAID. RAIDq uses a linear code with efficient encoding and decoding algorithms and addresses a wide range of general cases of RAID that are of practical interest. However, RAIDq does have a limit on how many data disks it can support, which we will analyze in this paper. A second benefit of RAIDq is that it includes existing RAID 5 and 6 as special cases and hence is 100% backward compatible. This allows RAIDq to reuse the efficient coding algorithms and implementations of RAID 5 and 6. Last but not least, RAIDq is optimized for software implementation, as its encoding only involves simple XOR and multiplication by several fixed elements in a finite field. Thanks to the popularity of RAID 6, such operations have been highly optimized on modern processors, of which RAIDq can take advantage, as corroborated by our experiment results.

Original languageEnglish
StatePublished - 2013
Externally publishedYes
Event5th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2013 - San Jose, United States
Duration: 27 06 201328 06 2013

Conference

Conference5th USENIX Workshop on Hot Topics in Storage and File Systems, HotStorage 2013
Country/TerritoryUnited States
CitySan Jose
Period27/06/1328/06/13

Bibliographical note

Publisher Copyright:
© 2013 USENIX Association. All rights reserved.

Fingerprint

Dive into the research topics of 'RAIDq: A software-friendly, multiple-parity RAID'. Together they form a unique fingerprint.

Cite this