Set-by-Set Data Commit for Storage Modules
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Storage modules face performance degradation and data loss when moving data from lower bit-per-cell density areas to higher bit-per-cell density areas due to error events, leading to incorrect discarding of data and inefficient use of higher density areas.
Innovation Solution
A storage module with control circuitry that organizes data into sets, performs post-write-read error analysis, and updates an address database to commit valid data sets on a set-by-set basis, allowing partial data blocks to be utilized and using scrambling keys for correct data retrieval even if not all sets are copied successfully.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data is moved from lower bit-per-cell density area to higher bit-per-cell density area, then storage efficiency is improved, but data loss occurs due to error events
Solution Approach 1:
The patent segments the data movement process into individual set-level operations. Each set is copied and verified independently, allowing the system to identify exactly which sets succeeded or failed. This segmentation enables partial commits without requiring complete success or total rollback, resolving the contradiction by maintaining data integrity through granular control while improving storage efficiency through selective commitment of successful sets.
Solution Approach 2:
The patent implements a feedback mechanism through post-write-read error analysis. After copying each set to the higher density area, the system reads back and verifies the data. This feedback loop provides information about which sets were successfully written, enabling the commit determination module to make informed decisions about which sets to commit to the address database, thus maintaining reliability while achieving storage efficiency.
2Reliability
If entire data movement process is repeated upon error event, then data integrity is maintained, but performance decreases
Solution Approach 1:
The patent divides the data movement into discrete sets that can be independently committed. When an error occurs, only the affected sets need to be reprocessed rather than the entire data movement process. This segmentation allows the system to maintain data integrity by verifying each set while improving performance by avoiding redundant operations on successfully transferred sets.
Solution Approach 2:
The patent applies partial action by committing only the sets that were successfully verified rather than requiring complete success of the entire data movement process. The commit determination module selectively updates the address database for successful sets, allowing the system to maintain integrity through verification while improving performance by accepting partial completion rather than requiring full repetition.
3Quantity of substance
If data is organized into sets for set-by-set copying, then storage efficiency is improved, but device complexity increases
Solution Approach 1:
The patent organizes data into sets as a logical segmentation that enables efficient partial commits and verification. While this does increase control circuitry complexity through the addition of selection tracking and commit determination modules, the segmentation provides significant storage efficiency benefits by enabling selective commitment of successful transfers and avoiding the need to reprocess entire data blocks.
Data Source
AI summary
A storage module may be configured to organize data to be moved from an initial storage location to a destination storage location into sets, and to determine whether to commit the data to the destination storage location on a set-by-set basis. Error correction and/or a post write and read process may be performed on the sets that are copied to the destination storage location to determine whether to commit each of the copied sets.