RAID Data Recovery Using Long Parity Check Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional RAID storage systems can only recover data from a single failed storage medium, limiting their ability to handle multiple erasures or errors effectively.
Innovation Solution
The implementation of a data storage and retrieval system that generates and decodes codewords using a long parity check matrix, allowing for the recovery of data even when multiple codewords are corrupted by creating a long vector from the codewords and encoded parity block.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If standard RAID systems use XOR-based parity codewords for data recovery, then single medium failure can be recovered, but multiple failed media cannot be recovered
Solution Approach 1:
The patent changes the fundamental parameter of the parity generation method from simple XOR operations to polynomial-based encoding (Reed-Solomon or BCH codes). This transformation enables the system to recover from multiple erasures by treating each missing codeword as an erasure that can be mathematically reconstructed using the polynomial relationships established during encoding, thereby resolving the limitation of single-failure recovery
Solution Approach 2:
The patent segments the data into multiple independent codewords distributed across different storage media, with each codeword being a separate encoded portion of the original data. This segmentation allows the system to apply different decoding strategies to different segments and reconstruct the original data even when some segments are lost, enabling recovery from multiple failed media
2Reliability
If forward error correction codes are used to transform messages into longer codewords, then error detection and correction capability is improved, but storage efficiency decreases due to lower code rate
Solution Approach 1:
The patent applies partial error correction by focusing specifically on erasure recovery rather than attempting to correct all possible errors. By treating missing codewords as erasures (known positions of missing data) rather than general errors, the system can recover using fewer redundant bits than would be required for full error correction, thus maintaining better storage efficiency while achieving the desired reliability
Data Source
AI summary
A method and apparatus for improved data recovery in data storage systems is described. When errors occur while retrieving a plurality of codewords from a plurality of storage devices, a long vector may be formed from the plurality of codewords and decoded by a special, long parity check matrix to re-create data stored on the plurality of storage devices when normal decoding efforts fail.