On the speedup of single-disk failure recovery in XOR-coded storage systems: Theory and practice
- 1 April 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 2160195X,p. 1-12
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- A Hybrid Approach to Failed Disk Recovery Using RAID-6 CodesACM Transactions on Storage, 2011
- NCFS: On the Practicality and Extensibility of a Network-Coding-Based Distributed File System2011
- Rebuilding for array codes in distributed storage systems2010
- Flat XOR-based erasure codes in storage systems: Constructions, efficient recovery, and tradeoffs2010
- Tree-structured Data Regeneration in Distributed Storage Systems with Regenerating Codes2010
- Building parallel regeneration trees in distributed storage systems with asymmetric links2010
- STAR : An Efficient Coding Scheme for Correcting Triple Storage Node FailuresIEEE Transactions on Computers, 2008
- OceanStore2000
- Architectures and algorithms for on-line failure recovery in redundant disk arraysDistributed and Parallel Databases, 1994
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960