Concurrent Buffer Segmentation for Disk Error Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage devices face challenges in minimizing command completion time (CCT) due to sequential recovery processes for failed data blocks, which prolong recovery times, especially when re-read attempts fail, leading to increased CCT in instances of seek-and-settle errors or off-track read heads.
Innovation Solution
Implementing a method that selects and concurrently executes multiple recovery schemes, such as recursive read averaging (RRA) and retry, within a single buffer space, allowing dynamic allocation and reallocation of buffers during ongoing recovery operations to decode failed data blocks, thereby optimizing decoding throughput and reducing recovery time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequential recovery processes (re-read attempts followed by recovery algorithms) are used for failed data blocks, then error correction can be performed systematically, but command completion time increases
Solution Approach 1:
The patent segments the buffer space into multiple independent buffer regions, each dedicated to a specific recovery scheme (e.g., RRA buffer region, retry buffer region). This allows concurrent execution of multiple recovery algorithms on different failed data blocks simultaneously, rather than processing them sequentially through a single shared buffer, thereby reducing command completion time while maintaining comprehensive error correction capability
Solution Approach 2:
The patent pre-allocates and prepares multiple buffer regions for different recovery schemes before recovery operations begin. When failed data blocks are detected, the system can immediately assign them to appropriate pre-configured buffer regions and initiate concurrent recovery processes without waiting for sequential buffer availability, thus reducing latency and command completion time
2Productivity
If multiple recovery schemes are executed concurrently in a single buffer space, then decoding throughput increases, but buffer management complexity increases
Solution Approach 1:
The patent divides the buffer space into distinct, non-overlapping buffer regions for different recovery schemes. Each buffer region is independently managed and dedicated to a specific recovery algorithm (e.g., RRA, retry). This segmentation eliminates complex dynamic allocation and switching logic, as each region operates independently with its own fixed parameters and recovery strategy, thereby simplifying buffer management while enabling concurrent processing that increases decoding throughput
Solution Approach 2:
The patent creates a universal buffer management framework where multiple buffer regions with different specialized functions (RRA buffer, retry buffer, etc.) collectively serve the overall error recovery process. Each buffer region is optimized for its specific recovery scheme but all regions operate under a unified buffer management architecture that handles allocation, monitoring, and coordination, achieving high decoding throughput through concurrency while maintaining manageable complexity through standardized interfaces
Data Source
AI summary
An error recovery process provides for selecting a first recovery scheme for a decoding attempt on a first subset of a set of failed data blocks read from a data track; selecting a second different recovery scheme for a decoding attempt on a second subset of the set of failed data blocks read from the data track; and during a single revolution of the data track, performing operations to decode a first subset of the failed data blocks according to the first recovery scheme operations to decode the second subset of the failed data blocks according to the second different recovery scheme.