Flash Memory Log Block Reuse for Erase Count Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Flash memory devices face increased erase count and reduced lifespan due to frequent erase operations, as they typically erase data in larger block units, leading to unnecessary data restoration and inefficient memory management.
Innovation Solution
Implement methods to designate log blocks as reusable without erasing them, based on the amount of clean memory, and manage memory blocks by copying valid data to free blocks and allocating log blocks to reusable or erasable pools, reducing the need for unnecessary erase operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If block erase operations are performed to replace data in flash memory, then data can be updated, but the erase count increases and device lifespan decreases
Solution Approach 1:
The patent segments the memory block into valid data portions and invalid data portions, allowing selective erasure of only the invalid portions rather than erasing the entire block. This segmentation enables partial erase operations that update data without increasing the overall erase count unnecessarily.
Solution Approach 2:
The patent recovers and reuses valid data portions from previously erased blocks by identifying and preserving valid data before erasure operations. This recovery mechanism reduces the need for frequent erase operations by maintaining usable data in memory blocks that would otherwise be discarded.
2Adaptability or versatility
If entire blocks are erased to update data, then data replacement is enabled, but unnecessary data restoration is required
Solution Approach 1:
The patent divides the memory block into segments of valid and invalid data, allowing the system to identify and preserve valid data portions during erase operations. This segmentation eliminates the need to restore valid data after erasure, saving time and reducing unnecessary operations.
Solution Approach 2:
The patent performs preliminary identification of valid data portions before executing erase operations. By pre-mapping and identifying valid data locations, the system可以避免 subsequent data restoration steps, as the valid data is already known and preserved before the erase operation begins.
3Productivity
If frequent erase operations are performed, then data can be updated frequently, but the erase count increases and affects device lifespan
Solution Approach 1:
The patent implements a recovery mechanism that identifies and preserves valid data portions from blocks scheduled for erasure. By recovering valid data before erasure, the system reduces the frequency of actual erase operations needed, thereby maintaining high data update capability while reducing the cumulative erase count that degrades device lifespan.
Solution Approach 2:
The patent changes the erasure parameter from block-level erasure to page-level or partial block erasure. By modifying the granularity of the erase operation from entire blocks to only the necessary invalid portions, the system enables frequent updates while significantly reducing the erase count impact on device lifespan.
4Ease of operation
If large block units are erased for data replacement, then flash memory operation is simplified, but memory management efficiency decreases
Solution Approach 1:
The patent segments the erase operation into selective portions within a block, allowing the system to erase only invalid data pages while preserving valid data. This segmentation maintains the simplicity of block-based management while improving efficiency by avoiding erasure of valid data portions.
Solution Approach 2:
The patent applies partial erasure action by erasing only the necessary invalid portions of a block rather than the entire block. This partial action approach maintains operational simplicity while significantly improving memory management efficiency by reducing unnecessary erasure operations and preserving valid data.
Data Source
AI summary
Methods of operating a non-volatile memory device that includes a first data block that stores first data and a first log block that stores an updated version of at least some of the first data is provided in which valid portions of the first data in the first data block are copied to a free block that has no data to generate a second data block. The updated version of at least some of the first data from the first log block is copied to the second data block. The first log block is designated as a reusable log block without erasing the data therefrom in response to at least one predetermined condition being satisfied.