RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities

Handle URI:
http://hdl.handle.net/10754/622592
Title:
RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities
Authors:
Lin, Sian-Jheng; Alloum, Amira; Al-Naffouri, Tareq Y.
Abstract:
In computer storage, RAID 6 is a level of RAID that can tolerate two failed drives. When RAID-6 is implemented by Reed-Solomon (RS) codes, the penalty of the writing performance is on the field multiplications in the second parity. In this paper, we present a configuration of the factors of the second-parity formula, such that the arithmetic complexity can reach the optimal complexity bound when the code length approaches infinity. In the proposed approach, the intermediate data used for the first parity is also utilized to calculate the second parity. To the best of our knowledge, this is the first approach supporting the RAID-6 RS codes to approach the optimal arithmetic complexity.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Lin S-J, Alloum A, Al-Naffouri TY (2016) RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities. 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). Available: http://dx.doi.org/10.1109/PIMRC.2016.7794681.
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
Issue Date:
24-Dec-2016
DOI:
10.1109/PIMRC.2016.7794681
Type:
Conference Paper
Additional Links:
http://ieeexplore.ieee.org/document/7794681/
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorLin, Sian-Jhengen
dc.contributor.authorAlloum, Amiraen
dc.contributor.authorAl-Naffouri, Tareq Y.en
dc.date.accessioned2017-01-02T09:55:32Z-
dc.date.available2017-01-02T09:55:32Z-
dc.date.issued2016-12-24en
dc.identifier.citationLin S-J, Alloum A, Al-Naffouri TY (2016) RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities. 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). Available: http://dx.doi.org/10.1109/PIMRC.2016.7794681.en
dc.identifier.doi10.1109/PIMRC.2016.7794681en
dc.identifier.urihttp://hdl.handle.net/10754/622592-
dc.description.abstractIn computer storage, RAID 6 is a level of RAID that can tolerate two failed drives. When RAID-6 is implemented by Reed-Solomon (RS) codes, the penalty of the writing performance is on the field multiplications in the second parity. In this paper, we present a configuration of the factors of the second-parity formula, such that the arithmetic complexity can reach the optimal complexity bound when the code length approaches infinity. In the proposed approach, the intermediate data used for the first parity is also utilized to calculate the second parity. To the best of our knowledge, this is the first approach supporting the RAID-6 RS codes to approach the optimal arithmetic complexity.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/document/7794681/en
dc.subjecterasure codesen
dc.subjectRAID-6 codesen
dc.subjectcomputational complexityen
dc.subjectDistributed storage systemsen
dc.titleRAID-6 reed-solomon codes with asymptotically optimal arithmetic complexitiesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journal2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)en
dc.contributor.institutionSchool of Information Science and Technology, University of Science and Technology of China (USTC)en
dc.contributor.institutionNokia Bell Labsen
kaust.authorAl-Naffouri, Tareq Y.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.