Distributed KVS Node Memory Management

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In conventional distributed KVS systems, data copying during rebalancing can lead to resource overflow, complicating system operation and reducing reliability.

Innovation Solution

Implementing a computer system with multiple nodes that set upper-limit data amounts for key ranges, ensuring that when a new key range is created, the sum of the upper-limit data amounts of existing and new ranges does not exceed the maximum memory volume, thereby preventing resource overflow.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If data copying is performed during rebalancing process, then data distribution balance is improved, but resource overflow occurs

Engineering Contradiction:
Improvedata distribution balanceVSAvoidmemory resource
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The system performs preliminary actions by setting upper-limit data amounts for key ranges before the rebalancing process begins. This prevents resource overflow during data copying by establishing capacity constraints in advance, allowing the rebalancing to proceed without exceeding memory resources.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system changes parameters by dynamically adjusting upper-limit data amounts for different key ranges based on the rebalancing progress and resource availability. This allows flexible control over data distribution while preventing resource overflow during the rebalancing process.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If upper-limit data amounts are set for key ranges, then resource overflow is prevented, but system complexity increases

Engineering Contradiction:
Improveresource overflow preventionVSAvoidsystem operation complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system implements self-service by automatically managing upper-limit data amounts for key ranges without requiring manual intervention. The nodes autonomously adjust and enforce capacity constraints, simplifying operation while maintaining reliability through automated resource management.

Inventive Principle:
Principle #25Self-service

3Adaptability or versatility

If new key range is created during rebalancing, then data distribution flexibility is improved, but resource management becomes complex

Engineering Contradiction:
Improvedata distribution flexibilityVSAvoidresource management complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

When a new key range is created during rebalancing, the system dynamically changes parameters by setting appropriate upper-limit data amounts for the new range based on available resources. This maintains flexibility in data distribution while managing resource allocation through automated parameter adjustment.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system applies dynamics by making upper-limit data amounts adjustable and responsive to changing conditions during rebalancing. When new key ranges are created or existing ranges are modified, the system dynamically recalibrates resource allocation to maintain balance without manual intervention.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS10719496B2Computer system and data processing method
Publication Date: 2020.07.21 HITACHI LTD
  • US10719496B2 patent drawing
  • US10719496B2 patent drawing
  • US10719496B2 patent drawing

AI summary

This computer system includes a plurality of nodes for forming a distributed KVS. The plurality of nodes have a plurality of key ranges to which upper-limit data amounts are set, each upper-limit data amounts being an upper limit of an amount of manageable data. When a new key range is created, the plurality of nodes lowers an upper-limit data amount of an existing key range so that the sum of an upper-limit data amount of the new key range and an upper-limit data amount of the existing key range does not exceed a maximum amount which is the amount based on the volume of the memory of the computer apparatus.