Non-volatile Storage Candidate Address Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
There is a need to increase the data write speed in non-volatile storage devices, as existing technologies have limitations in efficiently managing data write operations.
Innovation Solution
A non-volatile storage device with a storage section comprising multiple block sections and page sections, where each page section can write data independently, and a calculation section that calculates candidate addresses based on write conditions to optimize data writing, allowing for sequential writing and efficient data management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If data is written sequentially using calculated candidate addresses, then data write speed increases, but device complexity increases due to the calculation section and address management mechanisms
Solution Approach 1:
The calculation section pre-calculates candidate addresses before data writing operations, preparing optimal write locations in advance based on current storage conditions. This preliminary address calculation enables sequential writing without real-time computation overhead, improving write speed while managing complexity through advance preparation
Solution Approach 2:
The calculation section acts as an intermediary between the host device and the storage section, translating write requests into optimized candidate addresses. This intermediary layer manages the complexity of address calculation internally while presenting a simplified interface to external devices, thereby improving write performance without proportionally increasing overall system complexity
2Adaptability or versatility
If multiple block sections are used for independent page writing, then data write flexibility improves, but device complexity increases due to collective deletion requirements
Solution Approach 1:
The storage section is segmented into multiple block sections, each containing multiple page sections that can be written independently. This segmentation enables flexible data writing operations where different blocks can be accessed and written simultaneously or independently, improving adaptability while maintaining manageable complexity through modular organization
Solution Approach 2:
While pages within blocks are independently writable, the deletion operation merges multiple pages back to a collective level. This combining approach simplifies memory management by handling invalidation and garbage collection at the block level rather than individual page level, reducing operational complexity despite the fine-grained write capability
3Productivity
If candidate addresses are calculated based on write conditions, then data write efficiency improves, but loss of time occurs during address calculation
Solution Approach 1:
The calculation section performs address calculation in advance based on current storage conditions and write patterns, preparing candidate addresses before actual data writing begins. This preliminary computation avoids time-consuming real-time calculations during write operations, improving overall efficiency while minimizing time loss through advance preparation
Solution Approach 2:
The calculation section uses feedback from current storage conditions (such as valid data locations, free space distribution, and write patterns) to dynamically adjust candidate address calculations. This feedback mechanism optimizes address selection based on actual storage state, improving write efficiency while reducing time loss by avoiding calculations for obviously suboptimal addresses
Data Source
AI summary
A non-volatile storage device according to an embodiment of the present technology includes a storage section and a calculation section. The storage section includes a plurality of block sections each including a plurality of page sections into which data can be written independent of each other, the plurality of block sections being capable of collectively deleting the data written in the plurality of page sections. The calculation section calculates, on the basis of information about write conditions of the plurality of page sections included in the storage section, candidate addresses that are candidates of logical addresses of the data to be written into the plurality of page sections.