Smart Rebuilding of Encoded Data Slices in Dispersed Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in efficiently rebuilding encoded data slices, particularly in scenarios where storage units fail or become unavailable, leading to data corruption and loss, and existing solutions are inefficient in managing and maintaining data redundancy.

Innovation Solution

The implementation of a dispersed storage network with a managing unit and integrity processing unit that uses Cauchy Reed-Solomon encoding to distribute data into encoded slices, allowing for error correction and reconstruction of missing slices, thereby ensuring data integrity and availability across multiple storage units.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If traditional RAID systems are used for data storage, then data redundancy is provided, but the system lacks flexibility and scalability in distributed environments

Engineering Contradiction:
Improveflexibility and scalabilityVSAvoiddata redundancy
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The patent segments data into multiple encoded slices distributed across different storage units using Cauchy Reed-Solomon coding. This segmentation enables flexible distribution while maintaining data redundancy, as any sufficient number of slices can reconstruct the original data, resolving the contradiction between adaptability and reliability.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system dynamically adjusts encoding parameters such as the number of slices, repair slices, and decode thresholds based on storage capacity and failure scenarios. This parameter flexibility allows the system to adapt to different distributed environments while maintaining robust data protection, balancing adaptability and reliability.

Inventive Principle:
Principle #35Parameter changes

2Reliability

If all encoded data slices are rebuilt after storage unit failure, then data integrity is restored, but processing costs and time are significantly increased

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent implements partial rebuilding by reconstructing only the specific missing encoded slice rather than rebuilding all slices. The system identifies which slice is missing and retrieves only the necessary repair slice, significantly reducing processing overhead while maintaining data integrity, thus resolving the contradiction between reliability and productivity.

Inventive Principle:
Principle #16Partial or excessive action

Solution Approach 2:

The system employs repair slices that contain pre-computed correction information enabling automatic reconstruction of missing slices without manual intervention. The self-healing mechanism efficiently restores data integrity by using the repair slices to correct errors and rebuild missing data, balancing reliability with processing efficiency.

Inventive Principle:
Principle #25Self-service

3Productivity

If repair slices are pre-computed and stored, then rebuilding efficiency is improved, but storage capacity is consumed

Engineering Contradiction:
Improverebuilding efficiencyVSAvoidstorage capacity
Core Design Contradiction:
ProductivityVSQuantity of substance

Solution Approach 1:

The patent applies local quality by storing repair slices selectively in specific storage units based on their capacity and role. Not all storage units hold repair slices; instead, they are distributed to appropriate units, optimizing storage utilization while maintaining rebuilding efficiency. This resolves the contradiction between productivity and storage capacity by making storage allocation non-uniform and purpose-driven.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS12093527B2Smart rebuilding of an encoded data slice
Publication Date: 2024.09.17 PURE STORAGE INC
  • US12093527B2 patent drawing
  • US12093527B2 patent drawing
  • US12093527B2 patent drawing

AI summary

A method includes determining an encoded data slice of a first subset of encoded data slices associated with a set of encoded data slices requires rebuilding, where the first subset of encoded data slices is stored in a set of storage units and includes at least a decode threshold number of encoded data slices. The method further includes identifying a second encoded data slice of a second subset of encoded data slices of the set of encoded data slices, where the second subset of encoded data slices is not currently stored in the set of storage units. The method further includes generating the second encoded data slice from the first subset of encoded data slices and sending the second encoded data slice to the set of storage units, where when stored, the second encoded data slice no longer included in the second subset of encoded data slices.