Initialization-less Parity in Distributed Data Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Distributed data storage systems face inefficiencies in initialization and data access times due to the need for online and offline parity computations, which consume processing resources and time, especially during system start-up and data storage operations.

Innovation Solution

The system eliminates parity computations during initialization by assuming unwritten data locations as zero values when computing parity data after user data is written, allowing for faster system readiness and reduced processing overhead.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If parity computations are performed during initialization, then data storage reliability is ensured, but system initialization time and processing overhead increase

Engineering Contradiction:
Improvedata storage reliabilityVSAvoidsystem initialization time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-computing and storing parity information in metadata during the data writing process, before initialization is needed. This allows the system to skip time-consuming parity computations during initialization while still ensuring data reliability through the pre-prepared parity data stored in the metadata section of data storage units.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If parity computations are performed online during data access, then data integrity is maintained, but data access time and processing resources increase

Engineering Contradiction:
Improvedata integrityVSAvoiddata access time
Core Design Contradiction:
ReliabilityVSSpeed

Solution Approach 1:

The patent performs preliminary computation of parity information during the data writing phase and stores it in metadata. During data access operations, the system directly retrieves the pre-computed parity data from metadata without performing additional computations, thereby maintaining data integrity while significantly reducing data access time and processing resource requirements.

Inventive Principle:
Principle #10Preliminary action

3Reliability

If all data locations are initialized with parity computations, then system reliability is ensured, but processing overhead and resource consumption increase

Engineering Contradiction:
Improvesystem reliabilityVSAvoidprocessing overhead
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent extracts the parity computation function from the main data processing flow and implements it separately during the data writing phase. By isolating the parity computation to specific moments when data is written and storing results in metadata, the system ensures reliability without incurring continuous processing overhead during normal operations.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system performs preliminary parity computation during data writing operations and stores the results in metadata. This preliminary action eliminates the need for repeated parity computations during initialization and data access, significantly reducing processing overhead and energy consumption while maintaining system reliability.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11016848B2Distributed data storage system with initialization-less parity
Publication Date: 2021.05.25 SEAGATE TECH LLC
  • US11016848B2 patent drawing
  • US11016848B2 patent drawing
  • US11016848B2 patent drawing

AI summary

In a data storage system with distributed data storage units, initialization-less parity can be practiced with a storage controller connected to a storage memory and multiple data storage units. Data locations of data storage devices of the respective data storage units can be arranged as distributed data storage groups as directed by the storage controller prior to receiving a write request to a distributed data storage group. Unwritten data locations of the distributed data storage group are identified by consulting the storage memory and each unwritten data storage location may be assumed to have a zero value when computing parity data for the distributed data storage group.