Memory Data Relocation via Adaptive Sparse and Dense Procedures

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data relocation operations in memory systems are inefficient due to increased latency and power consumption when dealing with a large quantity of valid pages, as they require updating the mapping between logical and physical addresses for each page.

Innovation Solution

The memory system selects between a sparse and dense data relocation procedure based on parameters associated with the operation, such as the percentage of valid pages. The dense procedure writes both valid and invalid pages to a new block without updating the mapping, reducing latency and power consumption.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the memory system updates the mapping between logical and physical addresses for each page during data relocation, then data can be accurately relocated, but latency and power consumption increase significantly

Engineering Contradiction:
Improvedata relocation accuracyVSAvoidrelocation latency
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments data relocation into two distinct procedures: sparse data relocation (updating mappings for valid pages) and dense data relocation (copying blocks without mapping updates). This segmentation allows the system to choose the appropriate procedure based on the number of valid pages, avoiding the latency penalty of updating mappings for every page when unnecessary

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of mapping update behavior based on the density of valid pages. When the percentage of valid pages exceeds a threshold, the system switches to dense data relocation that does not update mappings, fundamentally changing the relocation approach to reduce latency while maintaining correctness through the block copy operation

Inventive Principle:
Principle #35Parameter changes

2Reliability

If the memory system updates the mapping between logical and physical addresses for each page during data relocation, then data can be accurately relocated, but power consumption increases significantly

Engineering Contradiction:
Improvedata relocation accuracyVSAvoidrelocation power consumption
Core Design Contradiction:
ReliabilityVSUse of energy by stationary object

Solution Approach 1:

The patent segments data relocation into two distinct procedures: sparse data relocation (updating mappings for valid pages) and dense data relocation (copying blocks without mapping updates). This segmentation allows the system to choose the appropriate procedure based on the number of valid pages, avoiding the power consumption penalty of updating mappings for every page when unnecessary

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the parameter of mapping update behavior based on the density of valid pages. When the percentage of valid pages exceeds a threshold, the system switches to dense data relocation that does not update mappings, fundamentally changing the relocation approach to reduce power consumption while maintaining correctness through the block copy operation

Inventive Principle:
Principle #35Parameter changes

3Ease of operation

If the memory system uses sparse data relocation procedure, then mapping updates are performed for valid pages, but the operation becomes inefficient when dealing with large quantities of valid pages

Engineering Contradiction:
Improvemapping update completenessVSAvoidrelocation efficiency
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The patent implements dynamic selection between two relocation procedures based on the number of valid pages. The system adapts its behavior from sparse to dense relocation depending on the data density, optimizing productivity for different scenarios rather than using a fixed approach

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of mapping update behavior based on the density of valid pages. When the percentage of valid pages exceeds a threshold, the system switches to dense data relocation that does not update mappings, fundamentally changing the relocation approach to reduce latency while maintaining correctness through the block copy operation

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS12293101B2Data relocation operation techniques
Publication Date: 2025.05.06 MICRON TECHNOLOGY INC
  • US12293101B2 patent drawing
  • US12293101B2 patent drawing
  • US12293101B2 patent drawing

AI summary

Methods, systems, and devices for data relocation operation techniques are described. A memory system may include blocks of memory cells, for example, within a non-volatile memory device of the memory system. The memory system may identify a command to perform a data relocation operation associated with a block of memory cells and may select between a first procedure and a second procedure for performing the data relocation operation. The memory system may select between the first procedure and the second procedure based on whether one or more parameters associated with the data relocation operation satisfy a threshold. For example, the memory system may select the first procedure if the one or more parameters satisfy the threshold and may select the second procedure if the one or more parameters do not satisfy the threshold. The memory system may perform the data relocation operation using the selected procedure.