Compressed Multi-Page Parity Storage for Memory Write Reliability
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Memory sub-systems face inefficiencies in parity data storage due to frequent data integrity scans, which introduce latency and reduce performance, and the limited space for parity data storage can lead to data loss if not managed effectively.
Innovation Solution
Implementing a compression algorithm to convert multiple pages of parity data into a single compressed parity page, allowing for reduced storage space usage and minimizing the frequency of scan operations by initiating compression when parity block consumption exceeds a certain threshold, thereby extending the time before parity data release is necessary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If frequent data integrity scans are performed on parity data, then data reliability is improved, but system latency increases and performance deteriorates
Solution Approach 1:
The patent implements periodic scan operations on parity data at predetermined intervals rather than continuously or frequently. The controller is configured to perform scans of the parity data storage region at specific time intervals, reducing the frequency of interruptions to host operations while still maintaining data integrity verification. This periodic approach balances reliability assurance with system performance by limiting scan operations to necessary intervals.
2Reliability
If multiple pages of parity data are stored separately, then data redundancy is improved, but storage space consumption increases
Solution Approach 1:
The patent merges multiple separate parity data pages into a single consolidated parity data structure. Instead of storing each parity page independently in separate memory locations, the controller combines multiple parity pages (e.g., first parity page, second parity page, third parity page) into one unified parity data storage region. This consolidation maintains the redundancy capability while significantly reducing the total storage space required for parity data.
Solution Approach 2:
The consolidated parity data structure serves multiple functions simultaneously: it provides redundancy for multiple data pages, enables efficient single-location management, and reduces storage overhead. The unified parity storage region can be used to reconstruct any lost data page through XOR operations, making the parity structure universally applicable for protecting multiple data units while optimizing space utilization.
3Device complexity
If parity data storage space is limited, then device complexity is reduced, but data loss risk increases when parity blocks are consumed
Solution Approach 1:
The patent changes the parameter of parity data organization from multiple separate pages to a single consolidated structure. This parameter change transforms the storage management approach, allowing the system to maintain reliability with limited space by efficiently packing parity information. The consolidated structure enables the controller to track and manage parity data as a single entity, simplifying the monitoring of storage consumption while ensuring adequate space remains available for parity operations.
Data Source
AI summary
A processing device, operatively coupled with a memory device, is configured to perform a write operation on a page of a plurality of pages of a data unit of a memory device. The processing device further generates a parity page for data stored in the page of the data unit and associates the parity page with parity data associated with the data unit. Responsive to determining that a first size of the parity data is larger than a first threshold size, the processing device compresses the parity data. Responsive to determining that a second size of the compressed parity data is larger than a second threshold size, the processing device releases at least a subset of the parity data corresponding to a subset of the data that is free from defects.