L2P Gap Clustering for Stable Thin Provisioning Buffers

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods of thin provisioning suffer from inefficient utilization of gaps in the Logical to Physical (L2P) table due to greedy prioritization of the largest free address sequences, leading to wasted resources and instability in buffer allocations.

Innovation Solution

A method to identify and utilize large gaps in the L2P table by considering the low-density of occupied addresses, using clustering algorithms to mark and replace limited occupied addresses with other addresses, thereby optimizing data storage operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If greedy prioritization of the largest free address sequences is used in L2P table, then allocation simplicity is improved, but resource utilization efficiency deteriorates

Engineering Contradiction:
Improveallocation simplicityVSAvoidresource utilization efficiency
Core Design Contradiction:
Ease of operationVSLoss of energy

Solution Approach 1:

The patent changes the selection parameter from purely size-based (largest free sequence) to a composite criterion that considers both the size of free sequences and the density of occupied addresses. This allows the system to select gaps that are not necessarily the largest but have lower occupied address density, thereby improving resource utilization while maintaining reasonable allocation simplicity.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces a dynamic evaluation mechanism that assesses multiple parameters (free sequence length, occupied address density, gap stability) rather than relying on a static largest-first approach. This dynamic assessment allows the system to adaptively select the most suitable gap for allocation based on current L2P table state, improving overall resource utilization efficiency.

Inventive Principle:
Principle #15Dynamics

2Productivity

If large gaps in L2P table are utilized as RAM buffers, then system performance is improved, but stability of buffer allocation deteriorates

Engineering Contradiction:
Improvesystem performanceVSAvoidbuffer allocation stability
Core Design Contradiction:
ProductivityVSStability of the object's composition

Solution Approach 1:

The patent performs preliminary evaluation of gap stability before allocating gaps as RAM buffers. By assessing the stability characteristics of potential gaps in advance and selecting only those that meet stability criteria, the system ensures that allocated buffers remain stable and reliable, preventing future reallocation issues while still improving system performance through effective gap utilization.

Inventive Principle:
Principle #10Preliminary action

3Quantity of substance

If occupied addresses in gaps are marked and replaced, then gap availability is improved, but device complexity increases

Engineering Contradiction:
Improvegap availabilityVSAvoidaddress management complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent extracts and relocates occupied addresses from within identified gaps to appropriate locations outside the gaps. This extraction process clears the gaps of interfering occupied addresses, making them fully available for use as RAM buffers or other purposes, while the relocated addresses are placed in suitable alternative locations that do not compromise overall system functionality.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS20260056875A1Dynamic Clustering-Based Allocation of Free Chunks at L2P in Thin Provisioning
Publication Date: 2026.02.26 SANDISK TECHNOLOGIES LLC
  • US20260056875A1 patent drawing
  • US20260056875A1 patent drawing
  • US20260056875A1 patent drawing

AI summary

Large gaps in a L2P table that are disturbed by a few occupied addresses may be efficiently utilized by locating and considering the low-density of these occupied addresses in regards to the large gap (i.e., the gap free region altogether). By identifying a gap in a L2P table and then determining if the number of occupied addresses in the gap are less than a threshold value, the gap with the limited number of occupied addresses may be indicated as available RAM buffers for the system. The limited number of occupied addresses may then be marked and replaced with other addresses to evacuate a longer sequence of free addresses that can be used by the system, thereby optimizing data storage operations. In some embodiments, conventional clustering algorithms may be used to determine gap availability. In some embodiments, the stability several gaps may be tracked and used to determine storage priority.