摘要： 提出一种优化的小写操作RAID6算法XP-Code。该算法按对角线和逆对角线划分校验组，每个校验组中有一个校验块和N-2个数据块，校验块均匀分布在2条主对角线上。由于使用MDS编码，XP-Code只需XOR计算，且使用公式推导，实现简单。理论分析及与其他典型RAID6算法的比较表明，XP-Code的校验块计算、丢失数据恢复和小写操作等操作的效率都是最优的。
关键词:
纠错码,
RAID6算法,
小写操作
Abstract: This paper presents an optimal RAID6 algorithm, called XP-Code, to achieve small-write operations for double disk failure correction in RAID system. XP-Code partitions the erasure correcting group in the way of diagonal or anti-diagonal. There are one parity block and N-2 data blocks in each erasure correcting group. Parity blocks in diagonal group are stored on main anti-diagonal while parity blocks in anti-diagonal group are stored on main diagonal. The formula based on XOR operations is simple and easy to implement. By analyzing the algorithm and comparing with other RAID6 algorithms, the efficiency of calculating parity blocks, recovering missing blocks and small-write operations in XP-Code is proved to be optimal.
Key words:
erasure code,
RAID6 algorithm,
small-write operations
中图分类号:
那文武;柯 剑;孟晓烜;朱旭东;许 鲁. 一种优化的小写操作RAID6算法[J]. 计算机工程, 2009, 35(7): 11-13,2.
NA Wen-wu; KE Jian; MENG Xiao-xuan; ZHU Xu-dong; XU Lu. Optimal RAID6 Algorithm for Small-write Operations[J]. Computer Engineering, 2009, 35(7): 11-13,2.