Emulated EEE Memory Write Optimization via Partial Record Transfer
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Emulated electrically erasable (EEE) memories face delays in writing data due to the need to distinguish between valid and invalid data in non-volatile memory sectors, requiring extensive data transfer and complete erase operations, which are time-consuming.
Innovation Solution
Implementing a method where a subset of active records from the oldest filled sector are transferred to the currently filling sector, and a portion of the erase process is performed in response to updates, allowing for reduced and sequential write pulses to create space for new data without full data transfer and erase processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If complete data transfer and erase operations are performed in traditional EEE memory, then data validity is ensured, but write operation time increases excessively
Solution Approach 1:
The patent applies partial action by transferring only a subset of active records (e.g., first N records or records meeting specific criteria) from the oldest filled sector to the current sector, rather than transferring all active records. This partial transfer reduces the time required for write operations while maintaining sufficient valid data in the system, resolving the contradiction between ensuring data validity and reducing write operation time.
2Reliability
If all active records are transferred before erase operations, then complete data migration is achieved, but the process becomes excessively time-consuming
Solution Approach 1:
The patent segments the data transfer process by dividing active records into subsets based on criteria such as record age, access frequency, or sequential ordering. Only specific subsets (e.g., oldest N records or records with least recent access) are transferred in each write operation, while other records remain in the original sector. This segmentation enables faster write operations while progressively migrating data over multiple operations, balancing migration completeness with operational speed.
3Device complexity
If sequential ordering is used for data locations, then data organization is simplified, but access efficiency decreases for non-sequential operations
Solution Approach 1:
The patent applies local quality by using sequential ordering within specific contexts (such as within individual sectors or for recently accessed data) while allowing different organization schemes for different data subsets. For example, frequently accessed hot data may be organized differently from cold data, or sequential ordering may be applied only to the most recently written records. This approach maintains simplicity where needed while optimizing access speed for specific operation types.
Data Source
AI summary
An emulated electrically erasable memory system includes a random access memory (RAM) and a non-volatile memory (NVM). A write access to the RAM is received which provides first write data and a first address, where the first write data is stored in the RAM at the first address, and a currently filling sector of the NVM is updated to store both the first write data and the first address as a first record. In response to the write access, based on whether there are any remaining active records in an oldest filled sector of the NVM, a portion of an erase process or a transfer of up to a predetermined number of active records from the oldest filled sector to the currently filling sector is performed. The predetermined number of active records is less than a maximum number of total records that may be stored within the oldest filled sector.