RAID triple parity
RAID triple parity
复制标题
DOI：
10.1145/2421648.2421655
复制
发表时间：
2012-12
期刊：
影响因子：
--
通讯作者：
A. Goel;P. Corbett
中科院分区：
文献类型：
--
作者：
A. Goel;P. Corbett
RAID三重奇偶校验(RTP)是一种针对三个磁盘故障进行保护的新算法。它是双故障纠正行对角校验码的扩展。对于任意数量的数据磁盘，RTP仅使用三个奇偶校验磁盘。就所需和访问的冗余信息量而言，这是最佳的。RTP使用XOR运算并存储所有未编码的数据。可以证明，该算法的奇偶计算复杂度是最优的。译码复杂度也大大低于现有的同类码。本文还描述了该算法的一种对称变体，其中奇偶计算与三重重构是相同的。
RAID triple parity (RTP) is a new algorithm for protecting against three-disk failures. It is an extension of the double failure correction Row-Diagonal Parity code. For any number of data disks, RTP uses only three parity disks. This is optimal with respect to the amount of redundant information required and accessed. RTP uses XOR operations and stores all data un-encoded. The algorithm's parity computation complexity is provably optimal. The decoding complexity is also much lower than that of existing comparable codes. This paper also describes a symmetric variant of the algorithm where parity computation is identical to triple reconstruction.