Circular-Shift Data Recovery for Multi-Error Storage Arrays
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems lack an effective mechanism for recovering data that has been lost or corrupted due to errors, leading to reliability issues in storage and data access, particularly in modern consumer and industrial electronics where information usage is increasing and data integrity is critical.
Innovation Solution
A computing system with a circular-shift recovery mechanism that uses a prime shift factor to iteratively generate a target recovery set, enabling the recovery of erroneous data and check data by employing a storage engine to detect and correct errors through a combination of 'exclusive OR' or 'AOR' functions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional error detection and correction methods are used, then data reliability is maintained, but data recovery capability is insufficient when multiple errors occur
Solution Approach 1:
The system performs preliminary action by pre-distributing check data across multiple storage devices and establishing a circular-shift relationship among them before errors occur. This allows the system to proactively prepare recovery mechanisms rather than reactively attempting correction after data loss, enabling recovery even when multiple data blocks are corrupted.
Solution Approach 2:
The system applies parameter changes by using a prime number as the shift factor in the circular-shift mechanism. This specific parameter choice ensures that the check data systematically covers all possible error patterns across the data blocks, transforming the static error correction capability into a dynamic recovery system that adapts to different error scenarios.
2Reliability
If more check data is stored to improve error correction, then data integrity is enhanced, but storage efficiency decreases
Solution Approach 1:
The check data serves multiple functions simultaneously: it acts as error detection code, error correction code, and recovery data for multiple potential failure scenarios. By making the check data universal in its utility, the system enhances data integrity without proportionally increasing storage overhead, as the same check data blocks serve multiple protective roles.
Solution Approach 2:
The system creates distributed copies of check data across multiple storage devices in a circular-shift pattern. Rather than storing redundant copies of the entire dataset, the system stores transformed versions (shifted by prime factors) that collectively provide comprehensive error protection, achieving high data integrity with minimal storage overhead.
3Loss of information
If complex error recovery algorithms are implemented, then data recovery capability is improved, but computational complexity increases
Solution Approach 1:
The system segments the error recovery problem into manageable units by dividing the data into blocks and applying circular-shift operations at the block level. Each check data block is associated with specific data blocks through the prime-shift relationship, allowing the recovery process to focus on localized segments rather than requiring complex global analysis of the entire dataset.
Solution Approach 2:
The circular-shift mechanism introduces periodic action by systematically rotating through different shift positions based on the prime number factor. This periodic structure creates a predictable pattern in how check data relates to data blocks, simplifying the recovery algorithm compared to arbitrary complex transformations, as the system can leverage the repeating cyclic nature of the shifts.
Data Source
AI summary
A computing system includes an array of storage devices configured to provide access to storage data and check data corresponding to a data block length; and a storage engine, coupled to the array of storage devices, configured to: detect one more erroneous data, one more erroneous check data, or a combination thereof for representing the storage data, the check data, or a combination thereof inaccessible or failing a status check process after initial storage thereof, determine a prime shift factor for representing a smallest prime number not less than a block unit-quantity, wherein the block unit-quantity is for representing a quantity of shift units within the data block length, and iteratively generate a target recovery set based on a circular-shift mechanism utilizing the prime shift factor for recovering the one more erroneous data, the one more erroneous check data, or a combination thereof.