UFS Memory Table Management With Flexible RAID Page Grouping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The management of Flash memory devices is complicated by frequent access to files, invalid data, and power failures, leading to increased processing time and potential errors, with existing solutions lacking effective methods to mitigate these issues.

Innovation Solution

A method and apparatus for table management in a UFS communications architecture using flexible table page grouping, incorporating RAID protection mechanisms to protect tables and write RAID parity in real time, reducing processing load during power failures.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional table management methods are used in Flash memory devices, then the device can store and manage data, but the processing time increases due to frequent file access, invalid data management, and power failure recovery requirements

Engineering Contradiction:
Improvedata protectionVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by writing RAID parity information to protected pages immediately when table pages are updated, before power failure can occur. This advance protection mechanism ensures that if power is lost, the controller can recover using the pre-written parity data without requiring extensive processing to restore table integrity, thus reducing recovery time while maintaining data protection.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent implements beforehand cushioning by creating redundant parity copies of table data in advance and storing them in protected pages. This cushioning mechanism acts as a buffer against power failures, allowing the system to withstand disruptions without losing table integrity. The pre-stored parity data serves as a protective cushion that eliminates the need for time-consuming recovery processing.

Inventive Principle:
Principle #11Beforehand cushioning (Prior cushioning)

2Adaptability or versatility

If multiple types of internal management information are maintained in Flash memory, then comprehensive data management is achieved, but the complexity of managing these multiple tables increases

Engineering Contradiction:
Improvetable management flexibilityVSAvoidmanagement complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent applies merging by combining multiple table management operations into a unified RAID-protected structure. Instead of managing each table independently with separate protection mechanisms, the system merges all table pages under a common RAID protection framework with centralized parity management. This reduces the complexity of managing multiple tables while maintaining the ability to handle various file system requirements.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent implements universality by creating a multi-functional table management system where the same RAID protection mechanism serves all types of internal management tables. The unified approach allows the system to handle different table types (file allocation tables, inode tables, etc.) through a single versatile protection scheme, reducing management complexity while maintaining adaptability to various file system operations.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Reliability

If RAID protection mechanism is implemented for table pages, then data protection against power failure is improved, but the processing load increases due to parity calculation and writing

Engineering Contradiction:
Improvepower failure protectionVSAvoidprocessing load
Core Design Contradiction:
ReliabilityVSPower

Solution Approach 1:

The patent applies partial action by implementing RAID protection selectively only for table pages that require protection, rather than applying it uniformly to all data. The system identifies and protects only the critical management tables that need power failure protection, leaving other data without the overhead of parity calculation. This partial application reduces processing load while maintaining protection where most needed.

Inventive Principle:
Principle #16Partial or excessive action

Solution Approach 2:

The patent implements self-service by having the table management system generate and update its own parity information automatically as part of the normal table update process. When a table page is modified, the system automatically calculates the new parity and updates protected pages without requiring separate intervention or additional processing steps. This self-service approach integrates protection into the existing workflow, minimizing additional processing load.

Inventive Principle:
Principle #25Self-service

Data Source

PatentUS12430207B2Method and apparatus for performing table management of memory device in predetermined communications architecture with aid of flexible table page grouping
Publication Date: 2025.09.30 SILICON MOTION INC
  • US12430207B2 patent drawing
  • US12430207B2 patent drawing
  • US12430207B2 patent drawing

AI summary

A method for performing table management of a memory device in predetermined communications architecture with aid of flexible table page grouping and associated apparatus are provided. The method may include: utilizing the memory controller to perform a table management procedure to manage at least one table regarding internal management of the memory device. For example, the table management procedure may include: in response to updating a first previous table content of a first table among the at least one table being needed, writing a first updated table content of the first table into at least one first updated table page of at least one table block; and writing a first RAID parity of the first updated table content into a first parity page, wherein a first updated table page count of the at least one first updated table page protected by the first parity page is determined in real time.