3D Memory RAID Parity Buffering Without Swap Delays
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing RAID parity data calculation in memory systems requires multiple swap operations due to limited buffer space, leading to reduced write performance as the controller needs to wait for previous swap operations to complete before continuing.
Innovation Solution
The method involves calculating RAID parity data in units of page data corresponding to one word line and buffering it in a parity buffer space, allowing continuous storage without the need for frequent swap operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If RAID parity data is stored in a buffer space with limited capacity, then the buffer space can be reused through swap operations, but the write performance deteriorates due to multiple swap operations and waiting time
Solution Approach 1:
The buffer space is segmented into a first buffer space and a second buffer space. The first buffer space stores RAID parity data for a first set of data, while the second buffer space stores RAID parity data for a second set of data. This segmentation allows parallel processing and eliminates the need for swap operations between single buffer spaces, thereby improving write performance while maintaining efficient use of limited buffer capacity.
2Adaptability or versatility
If swap operations are performed to share limited buffer space in a time division manner, then buffer space utilization improves, but the write performance deteriorates due to calculation interruptions
Solution Approach 1:
By providing two separate buffer spaces that can operate independently and in parallel, the system enables continuous calculation and storage of RAID parity data without interruptions. While the first buffer space is being used, the second buffer space can simultaneously perform swap operations or prepare for the next data set, ensuring that the calculation process continues without waiting for previous operations to complete.
Data Source
AI summary
In once example, a memory system includes a controller and a three-dimensional non-volatile memory that are coupled. The three-dimensional non-volatile memory includes a three-dimensional memory array. The three-dimensional memory array includes a plurality of word lines and a plurality of pages that are coupled. The controller is configured to: calculate received page data corresponding to a first word line in units of page data corresponding to one word line to obtain first RAID parity data, and store the first RAID parity data in a parity buffer space; and calculate received page data corresponding to an (i+1)th word line and ith RAID parity data to obtain (i+1)th RAID parity data, and store the (i+1)th RAID parity data in the parity buffer space, the (i+1)th RAID parity data overwriting the ith RAID parity data, i being a positive integer greater than or equal to 1.