Dynamic Data Latch Assignment for Memory Latency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional computing devices face issues with latency and reliability when higher-priority operations interrupt lower-priority operations that are not yet completed, due to the shared use of data latches, leading to performance disruptions.
Innovation Solution
The implementation of dynamically assignable data latches, where an on-die controller manages multiple sets of data latches with unique identifiers, allowing for seamless switching and reassignment of latch identifiers to prioritize operations based on urgency, ensuring uninterrupted performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data latches are dedicated to specific operations, then reliability of the first operation is improved, but device complexity and loss of adaptability increase
Solution Approach 1:
The patent implements dynamic latch assignment where the controller can reassign data latches between operations based on priority. Instead of static dedication, the system continuously monitors operation status and reallocates latches when interruptions occur, allowing the same physical latches to serve multiple operations sequentially with proper state management
Solution Approach 2:
The patent segments the latch management function into distinct components: operation status tracking, priority determination, and latch reassignment logic. This segmentation allows the system to handle latch allocation independently for each operation while maintaining overall coordination, reducing the complexity burden
2Device complexity
If data latches are shared between operations, then device complexity is reduced, but latency and reliability of interrupted operations worsen
Solution Approach 1:
The patent performs preliminary actions by saving the state of the first operation into temporary storage before the data latch is reassigned to the second operation. This pre-savestage ensures that when the latch becomes available again, the first operation can resume from its saved state without data loss or extended latency
Solution Approach 2:
The patent introduces an intermediary mechanism (temporary storage/registry) that mediates between the first and second operations during latch reassignment. This intermediary holds the first operation's state information while the latch serves the second operation, preventing direct conflict and enabling smooth transitions without latency penalties
3Productivity
If data latches are reassigned to higher priority operations, then productivity is improved, but reliability of the reassigned operation worsens
Solution Approach 1:
The patent ensures continuity of useful action by maintaining the first operation's state in temporary storage and resuming its execution after the second operation completes. This continuous action approach ensures that data transmission for the first operation remains reliable and complete, while still allowing the second operation to utilize the latch when needed
Data Source
AI summary
Apparatus, systems, methods, and computer program products for providing dynamically assignable data latches are disclosed. A non-volatile memory die includes a non-volatile memory medium. A plurality of sets of data latches of a non-volatile memory die are configured to facilitate transmission of data to and from a non-volatile memory medium, and each of the sets of data latches are associated with a different identifier. An on-die controller is in communication with a sets of data latches. An on-die controller is configured to receive a first command for a first memory operation comprising a selected identifier. An on-die controller is configured to execute a first memory operation on a non-volatile memory medium using a set of data latches of a plurality of sets of data latches, and the set of data latches is associated with a selected identifier.