On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice
On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice
复制标题
DOI：
10.1109/msst.2012.6232371
复制
发表时间：
2012-04
期刊：
影响因子：
--
通讯作者：
Yunfeng Zhu;P. Lee;Yuchong Hu;Liping Xiang;Yinlong Xu
中科院分区：
文献类型：
--
作者：
Yunfeng Zhu;P. Lee;Yuchong Hu;Liping Xiang;Yinlong Xu
现代存储系统将冗余数据分条到多个磁盘上，以提供针对磁盘故障的可用性保证。数据冗余的一种形式是基于基于XOR的擦除码，其仅使用XOR操作进行编码和解码。除了提供容错功能外，存储系统还必须提供快速故障恢复功能，以避免数据不可用。我们考虑的问题，加快恢复的单磁盘故障的任意XOR为基础的纠删码。我们从理论和实践两个角度来解决这个问题。我们提出了一种替换恢复算法，它使用爬山技术搜索快速恢复的解决方案，使解决方案的搜索可以在很短的时间内完成。我们进一步实现了我们的替换恢复算法的并行架构之上，以证明其实用性。我们实验我们的替换恢复算法及其并行实现的网络存储系统的测试平台上，并证明，我们的替换恢复算法使用更少的恢复时间比传统的方法。
Modern storage systems stripe redundant data across multiple disks to provide availability guarantees against disk failures. One form of data redundancy is based on XOR-based erasure codes, which use only XOR operations for encoding and decoding. In addition to providing failure tolerance, a storage system must also provide fast failure recovery to avoid data unavailability. We consider the problem of speeding up the recovery of a single-disk failure for arbitrary XOR-based erasure codes. We address this problem from both theoretical and practical perspectives. We propose a replace recovery algorithm, which uses a hill-climbing technique to search for a fast recovery solution, such that the solution search can be completed within a short time period. We further implement our replace recovery algorithm atop a parallelized architecture to justify its practicality. We experiment our replace recovery algorithm and its parallelized implementation on a networked storage system testbed, and demonstrate that our replace recovery algorithm uses less recovery time than the conventional approach.