Flash Memory Data Merge via Logical Distance Calculation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The increasing demand for storage in portable devices like digital cameras and mobile phones leads to rapid wear of flash memory storage devices due to the dispersed logical units, which results in a high access count during data merge operations, reducing the device's lifetime.

Innovation Solution

A data merge method that calculates a logical distance value between physical units to determine the logical dispersion degree, allowing for a targeted data merge operation that reduces access counts and extends the device's lifespan by optimizing data transfer between source and recycling nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data merge procedure is performed to release spare physical units, then new spare physical units are released for storing new data, but the number of accesses to the memory storage device increases and the wear of the memory storage device accelerates

Engineering Contradiction:
Improvenumber of spare physical unitsVSAvoidwear of the memory storage device
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The patent calculates the logical distance value between physical units before performing the data merge operation. This preliminary calculation of the logical dispersion degree allows the system to select optimal source nodes that minimize the number of table accesses during the subsequent data merge, thereby reducing wear before the actual data copying occurs

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces and utilizes the parameter of 'logical distance value' to quantify the dispersion degree between logical units mapped by different physical units. By changing the selection criterion from random or simple nearest-neighbor selection to selection based on calculated logical distance, the system optimizes the data merge process to reduce access count and wear

Inventive Principle:
Principle #35Parameter changes

2Adaptability or versatility

If more logical units are dispersed across physical units, then data distribution is improved, but the number of tables that need to be accessed during data merge increases

Engineering Contradiction:
Improvedata distributionVSAvoidnumber of table accesses
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system performs preliminary calculation of the logical distance value based on the mapping relationships between logical units and physical units before initiating the data merge operation. This allows the system to pre-determine the optimal source node selection that minimizes table access requirements, thereby reducing the complexity of the data merge process while maintaining good data distribution

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent uses the calculated logical distance value as feedback information to guide the selection of source nodes during the data merge process. By feeding back the dispersion degree information, the system can dynamically adjust its selection strategy to choose source nodes that reduce the number of table accesses, thereby simplifying the overall process

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS10810121B2Data merge method for rewritable non-volatile memory storage device and memory control circuit unit
Publication Date: 2020.10.20 PHISON ELECTRONICS
  • US10810121B2 patent drawing
  • US10810121B2 patent drawing
  • US10810121B2 patent drawing

AI summary

A data merge method for a rewritable non-volatile memory module including a plurality of physical units is provided according to an exemplary embodiment of the disclosure. The method includes: obtaining a first logical distance value between a first physical unit and a second physical unit among the physical units, and the first logical distance value reflects a logical dispersion degree between at least one first logical unit mapped by the first physical unit and at least one second logical unit mapped by the second physical unit; and performing a data merge operation according to the first logical distance value, so as to copy valid from a source node to a recycling node.