arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.5282cs.ITmath.IT
收藏

STAIR码:一种通用的容错擦除码

STAIR Codes: A General Family of Erasure Codes for Tolerating Device and Sector Failures

Mingqiang Li, Patrick P. C. Lee

摘要:

实际的存储系统通常采用擦除码来容忍设备故障和扇区故障,这两者在该领域都是普遍存在的。然而,传统的纠删码采用设备级冗余来防止扇区故障,因此会产生显著的空间开销。最新的扇区磁盘(SD)代码仅适用于有限的配置。通过一个宽松的,但实际的假设,我们构造了一个一般家庭的擦除码称为\emph{STAIR codes},有效地和可证明的容忍设备和扇区故障没有任何限制的存储阵列的大小和容忍的设备故障和扇区故障的数量。我们提出了\emph{upstairs encoding}和\emph{downstairs encoding}方法,为不同的配置提供互补的性能优势。我们进行了广泛的实验STAIR代码在节省空间,编码/解码速度,和更新成本。我们证明,STAIR码不仅提高了空间效率比传统的纠删码,但也提供了更好的计算效率比SD码的基础上,我们特殊的代码结构。最后,我们提出了分析模型,表征STAIR码的可靠性,并表明,支持更广泛的配置由STAIR码是至关重要的容忍领域中发现的扇区故障突发。

英文摘要:

Practical storage systems often adopt erasure codes to tolerate device failures and sector failures, both of which are prevalent in the field. However, traditional erasure codes employ device-level redundancy to protect against sector failures, and hence incur significant space overhead. Recent sector-disk (SD) codes are available only for limited configurations. By making a relaxed but practical assumption, we construct a general family of erasure codes called \emph{STAIR codes}, which efficiently and provably tolerate both device and sector failures without any restriction on the size of a storage array and the numbers of tolerable device failures and sector failures. We propose the \emph{upstairs encoding} and \emph{downstairs encoding} methods, which provide complementary performance advantages for different configurations. We conduct extensive experiments on STAIR codes in terms of space saving, encoding/decoding speed, and update cost. We demonstrate that STAIR codes not only improve space efficiency over traditional erasure codes, but also provide better computational efficiency than SD codes based on our special code construction. Finally, we present analytical models that characterize the reliability of STAIR codes, and show that the support of a wider range of configurations by STAIR codes is critical for tolerating sector failure bursts discovered in the field.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑