Caching Groups by Write Count for Storage Efficiency

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data storage systems face inefficiencies in cache memory utilization, particularly in forming caching groups based on write counts, which affects read and write speed and data continuity, leading to suboptimal performance in handling increasing data volumes.

Innovation Solution

A data storage device and method that groups data into caching groups based on write counts, where each caching group includes a requested data block and additional blocks with the same write count, allowing for intelligent caching and improved data processing performance by prioritizing frequently accessed data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If data is cached individually in units of single data blocks, then caching flexibility is maintained, but cache memory utilization efficiency deteriorates

Engineering Contradiction:
Improvecaching flexibilityVSAvoidcache memory utilization efficiency
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The patent merges multiple data blocks into caching groups based on write count similarity. When forming a caching group, the system combines a target data block with other data blocks that have the same or similar write counts, thereby utilizing cache memory more efficiently through batch operations while maintaining adaptability through dynamic group formation based on write characteristics.

Inventive Principle:
Principle #5Merging (Combining)

2Speed

If caching groups are formed without considering write counts, then caching speed is improved, but data continuity deteriorates

Engineering Contradiction:
Improvecaching speedVSAvoiddata continuity
Core Design Contradiction:
SpeedVSStability of the object's composition

Solution Approach 1:

The patent applies local quality by differentiating caching group formation based on write count characteristics. Data blocks with similar write counts are grouped together, creating locally optimized caching groups that maintain data continuity patterns. This ensures that frequently accessed data (high write count) is cached together, preserving access patterns and improving both caching speed and data continuity.

Inventive Principle:
Principle #3Local quality

3Reliability

If all data blocks are cached regardless of write count, then data availability is improved, but cache memory efficiency deteriorates

Engineering Contradiction:
Improvedata availabilityVSAvoidcache memory efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent changes the parameter basis for caching from uniform treatment to write-count-based differentiation. By using write count as a classification parameter, the system forms caching groups that prioritize data with higher write counts (more frequently accessed). This ensures data availability for frequently accessed blocks while improving cache memory efficiency by avoiding wasteful caching of rarely accessed data.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS11544198B2Data storage device employing caching groups defined by write counts of data blocks and operating method thereof
Publication Date: 2023.01.03 MIMIRIP LLC
  • US11544198B2 patent drawing
  • US11544198B2 patent drawing
  • US11544198B2 patent drawing

AI summary

A data storage device may include a first memory apparatus including a plurality of data blocks having data classified in units of data blocks; a second memory apparatus in communication with the first memory apparatus to store data cached from the first memory apparatus; and a controller in communication with the first memory apparatus and the second memory apparatus. The controller is configured to perform a caching group based caching operation by controlling the first memory apparatus to cache data from the first memory apparatus to the second memory apparatus on a caching group basis. Each caching group includes a first data block requested for caching and one or more other data blocks having the same write count as a write count of the first data block.