Dispersed Storage Partial Task Execution with Encoded Data Slices

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current dispersed storage networks face challenges in efficiently encoding and decoding data across multiple storage units while ensuring data integrity and security, particularly in scenarios with multiple storage unit failures or data corruption.

Innovation Solution

The implementation of a dispersed storage network (DSN) that uses Cauchy Reed-Solomon error encoding to divide data into encoded data slices, which are then distributed across multiple storage units, allowing for secure and fault-tolerant storage and retrieval of data, with a managing unit coordinating storage parameters and an integrity processing unit rebuilding 'bad' or missing slices.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is divided into encoded slices and distributed across multiple storage units using error encoding, then data reliability and fault tolerance are improved, but system complexity increases

Engineering Contradiction:
Improvedata integrityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent divides data into multiple encoded slices using error encoding algorithms (e.g., Reed-Solomon, Cauchy Reed-Solomon). Each slice is stored separately on different storage units, allowing the system to tolerate failures of multiple storage units while maintaining data integrity. This segmentation approach directly resolves the contradiction by improving reliability through distribution while managing complexity through standardized encoding processes.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces managing units and integrity processing units as intermediary components that coordinate the encoding, distribution, and verification of data slices. These intermediaries abstract the complexity of error encoding and distributed storage management, allowing the system to achieve high reliability without exposing the full complexity to end users or applications.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If data is encoded and distributed across multiple storage units, then fault tolerance against storage unit failures is improved, but storage and retrieval time increases

Engineering Contradiction:
Improvefault toleranceVSAvoidstorage and retrieval time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs error encoding and data slicing in advance during the storage phase, distributing encoded slices across multiple storage units before any potential failures occur. This preliminary encoding ensures that when retrieval is needed, the system can immediately begin collecting slices from available storage units without performing complex encoding operations during the critical retrieval path, thus reducing retrieval time while maintaining fault tolerance.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent allows retrieval operations to proceed with fewer than the total number of encoded slices by using decoding algorithms that can reconstruct original data from a subset of slices. This partial action approach enables the system to retrieve data faster by not requiring all slices to be collected, thereby reducing retrieval time while still maintaining the fault tolerance benefit of having multiple distributed copies.

Inventive Principle:
Principle #16Partial or excessive action

3Reliability

If error encoding is used to protect against data corruption, then data security is improved, but processing overhead increases

Engineering Contradiction:
Improvedata securityVSAvoidprocessing overhead
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent employs various error encoding algorithms (Reed-Solomon, Cauchy Reed-Solomon, BCH, LDPC) with different parameters and strengths. By adjusting encoding parameters such as redundancy level, slice count, and decoding threshold, the system can optimize the balance between data security and processing overhead based on specific application requirements, allowing flexible trade-offs between reliability and computational cost.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10469406B2Partial task execution in a dispersed storage network
Publication Date: 2019.11.05 PURE STORAGE INC
  • US10469406B2 patent drawing
  • US10469406B2 patent drawing
  • US10469406B2 patent drawing

AI summary

A processing system in a dispersed storage and a task network DSTN determines whether or not to execute a partial task. When determined to execute the partial task, the processing system operates by determining execution steps and a schedule; identifying a portion of the contiguous data for execution of one or more steps of the execution steps; retrieving the portion of the contiguous data from the disk drive; executing the one or more steps of the execution steps in accordance with the schedule on the portion of the contiguous data to produce a partial result; dispersed storage error encoding the partial result to produce a plurality of sets of slices in accordance with dispersal parameters associated with one or more of the group of slices and the partial task; and facilitating storing a plurality of sets of slices in the DSTN.