Swappable Data Structure Management in Hybrid Memory Systems

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current storage class memory (SCM) systems face challenges in efficiently managing data across multiple memory devices with varying latency and endurance, leading to wear issues and performance bottlenecks due to the limited number of erase cycles in flash memory devices.

Innovation Solution

A method for managing swappable data structures based on access counts, where less frequently accessed data structures are moved from high-latency, low-cost memory devices to lower-latency devices, optimizing data placement to minimize latency and conserve the lifespan of flash memory by matching data structures with memory devices based on their endurance profiles.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If data structures are stored in low-latency first level memory devices, then data access performance is improved, but wear on flash memory devices increases due to frequent writes

Engineering Contradiction:
Improvedata access latencyVSAvoidflash memory endurance
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent segments data structures into swappable and non-swappable categories, and further segments swappable data structures into hot (frequently accessed) and cold (less frequently accessed) sets. This segmentation enables different data structures to be stored in different memory levels (first level high-performance memory vs. second level archival memory), resolving the contradiction between access speed and wear reduction by placing frequently accessed data in fast memory while storing less frequently accessed data in archival memory.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by treating different data structures differently based on their access patterns. Swappable data structures with high access counts remain in the first level memory device, while swappable data structures with low access counts are moved to the second level memory device. This differentiated treatment optimizes both performance and reliability locally for each data structure type.

Inventive Principle:
Principle #3Local quality

2Reliability

If swappable data structures with low access counts are moved to second level memory devices, then wear on first level memory devices is reduced, but data access latency increases

Engineering Contradiction:
Improvememory device lifespanVSAvoiddata access latency
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent implements dynamic data structure management where swappable data structures can be moved between memory levels based on their access counts. The system dynamically adjusts which data structures reside in the first level memory device and which are stored in the second level memory device, allowing optimization of both reliability and performance based on changing access patterns.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent uses access count as a parameter to determine data structure placement. By monitoring and comparing access counts against thresholds, the system changes the storage location parameter of data structures based on their access frequency, moving them between memory levels to optimize the balance between performance and reliability.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If data structures are copied to multiple memory devices for redundancy, then data availability is improved, but write operations increase consuming memory endurance

Engineering Contradiction:
Improvedata availabilityVSAvoidmemory erase cycles
Core Design Contradiction:
ReliabilityVSLoss of substance

Solution Approach 1:

The patent selectively copies swappable data structures to the second level memory device based on their access counts and swappability status. Not all data structures are copied - only those marked as swappable with low access counts are moved to archival storage. This selective copying approach provides redundancy for critical data while minimizing unnecessary write operations that would consume memory endurance.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS11907543B2Managing swappable data structures in a plurality of memory devices based on access counts of the data structures
Publication Date: 2024.02.20 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11907543B2 patent drawing
  • US11907543B2 patent drawing
  • US11907543B2 patent drawing

AI summary

Provided are a computer program product, system, and method for managing swappable data structures in a plurality of memory devices based on access counts of the data structures. Data structures indicated as swappable are updated less frequently than most frequently updated data structures. Data structures not indicated as swappable are maintained in a first level memory device and not moved to a second level memory device. The first level memory device has lower latency than the second level memory device. Access counts are maintained for the data structures stored in the first level memory device that are indicated as swappable. Data structures are selected in the first level memory device having lowest access counts. The selected data structures are removed from the first level memory device and retained in the second level memory device.