The RAID-6 Liberation Codes
The RAID-6 Liberation Codes
复制标题
DOI：
--
复制
发表时间：
2008-02
期刊：
影响因子：
--
通讯作者：
J. Plank
中科院分区：
文献类型：
--
作者：
J. Plank
RAID-6规范要求具有多个存储设备的存储系统能够容忍任何两个设备的故障。已经开发了许多可以实现RAID-6的擦除编码技术;然而，每种都有局限性。在本文中，我们描述了一类新的RAID-6码称为解放码。这些代码的编码、更新和解码要么是最优的，要么接近最优。它们的修改开销低于所有其他RAID-6代码，并且它们的编码性能通常也更好。我们提供了一个确切的规格的解放码，并评估其性能相对于其他RAID-6编码技术。在这个过程中，我们描述了一种称为比特矩阵调度的算法，它大大提高了解码的性能。最后，我们提出了一个免费提供的库，方便使用解放码在RAID-6系统。
The RAID-6 specification calls for a storage system with multiple storage devices to tolerate the failure of any two devices. Numerous erasure coding techniques have been developed that can implement RAID-6; however, each has limitations. In this paper, we describe a new class of RAID-6 codes called the Liberation Codes. These codes encode, update and decode either optimally or close to optimally. Their modification overhead is lower than all other RAID-6 codes, and their encoding performance is often better as well. We provide an exact specification of the Liberation Codes and assess their performance in relation to other RAID-6 coding techniques. In the process, we describe an algorithm called bit matrix scheduling, which improves the performance of decoding drastically. Finally, we present a freely available library which facilitates the use of Liberation Codes in RAID-6 sytems.