Memory Plane Latch Parity Storage to Free Cache Capacity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Storing parity information in cache memory reduces the available cache memory for other functions in memory systems, impacting performance in high-processing applications like AI, AR, VR, and gaming.
Innovation Solution
Store parity information in unused latches associated with memory planes instead of cache memory, and transfer it during programming periods using an interleaving scheme to reduce latency and conserve cache memory.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If parity information is stored in cache memory, then data protection is ensured, but available cache memory for other functions is reduced
Solution Approach 1:
The patent extracts parity information storage from cache memory to unused latches in the memory device. By moving parity storage to a different location (latches instead of cache), the system maintains data protection while freeing up cache memory for other functions. This is achieved by calculating parity information and storing it in unused latches during write operations, then retrieving it from latches during read operations.
Solution Approach 2:
The patent introduces unused latches as an intermediary storage mechanism between the memory array and cache memory. These latches serve as a mediator that holds parity information temporarily during write operations and provides it during read operations, eliminating the need to occupy cache memory for parity storage while still ensuring data protection.
2Loss of time
If parity information is transferred during programming periods using interleaving scheme, then latency is reduced, but system complexity increases
Solution Approach 1:
The patent implements periodic action by transferring parity information during programming periods using an interleaving scheme. The memory device alternates between storing data in latches and transferring parity information to the memory array, creating a periodic pattern that reduces latency by keeping the critical path busy without stalling for parity operations.
Solution Approach 2:
The interleaving scheme maintains continuity of useful action by overlapping parity transfer operations with data programming operations. Instead of sequentially completing all data writes before transferring parity, the system continuously performs both operations in an interleaved manner, maximizing resource utilization and reducing overall latency.
Data Source
AI summary
Methods, systems, and devices for redundant array parity information storage are described. A memory system may store parity information associated with data in one or more latches associated with one or more planes before writing the data from the latches to the one or more planes. The parity information may be transferred from the latches to the one or more planes. The memory system may temporarily transfer the parity information from the latches to the planes before completing the write operation in response to initiating a write operation that uses more of the latches, and may transfer the parity information back to the latches after the write operation is completed. The memory system may store, retrieve, and transfer the parity information to or from the latches according to an interleaving scheme associated with different write operations of the memory system.


