Spare Memory Rotation for Low-Movement DSN Rebuilds

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Dispersed storage systems face significant data movement challenges when a memory device fails, leading to reliability degradation and excessive data reassignment, which can exceed the memory's capacity and requirements.

Innovation Solution

Implementing a dispersed storage network with a managing unit, integrity processing unit, and computing devices that use error encoding and decoding techniques like Cauchy Reed-Solomon to distribute data across multiple storage units, allowing for efficient data reconstruction and minimization of data movement through strategic re-mapping and rebuilding of encoded data slices.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is reassigned to neighboring memory devices upon failure, then data availability is maintained, but data movement volume increases significantly

Engineering Contradiction:
Improvedata availabilityVSAvoiddata movement volume
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The system pre-identifies spare memory devices and prepares them in advance to assume data storage roles. When a memory device fails, the pre-prepared spare can immediately take over without requiring extensive data movement, as the reassignment topology is predetermined through the dispersal algorithm configuration.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

Data is divided into multiple dispersed slices stored across different memory devices. This segmentation allows individual slices to be reassigned to spares independently, reducing the total volume of data that needs to be moved compared to relocating entire data sets or large contiguous blocks.

Inventive Principle:
Principle #1Segmentation

2Reliability

If data is moved back to replacement drive upon failure recovery, then original storage location is restored, but reliability degrades due to excessive data movement

Engineering Contradiction:
Improvestorage system reliabilityVSAvoidreliability degradation from data movement
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The system implements dynamic reassignment where spares can permanently assume data slices from failed devices rather than temporarily holding them. This dynamic adaptation eliminates the need for subsequent data movement back to replacement drives, as the new allocation is final and optimized for the current system state.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The dispersal algorithm parameters are adjusted to optimize the balance between data redundancy and movement minimization. By modifying encoding parameters and spare allocation ratios, the system reduces the frequency and volume of data movement operations while maintaining adequate reliability margins.

Inventive Principle:
Principle #35Parameter changes

3Reliability

If redundant copies of data are maintained, then data retrieval reliability is improved, but storage efficiency decreases due to duplicate data

Engineering Contradiction:
Improvedata retrieval reliabilityVSAvoidstorage capacity utilization
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

Instead of creating full redundant copies of data, the system generates dispersed code slices through error-correcting codes. These slices are mathematical transformations of the original data that collectively encode the same information, providing redundancy with significantly reduced storage requirements compared to traditional mirroring approaches.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The system uses adjustable dispersal algorithm parameters to control the trade-off between redundancy level and storage efficiency. By optimizing code rate and slice distribution parameters, the system achieves high retrieval reliability while minimizing the total storage capacity consumed by redundant information.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10440116B2Minimizing data movement through rotation of spare memory devices
Publication Date: 2019.10.08 PURE STORAGE INC
  • US10440116B2 patent drawing
  • US10440116B2 patent drawing
  • US10440116B2 patent drawing

AI summary

A distributed storage network (DSN) includes a plurality of distributed storage task execution (DST EX) units, each which includes a plurality of distributed storage (DS) memories configured to store encoded data slices. A DST EX unit detects a physical storage failure associated with a first DS memory included in the DST EX unit, wherein the first DS memory is associated with a sub-DSN address range. An available spare DS memory included in the DST EX unit is selected, and slice mapping information is updated to associate the available spare DS memory with the sub-DSN address range. The DST EX unit facilitates rebuilding one or more encoded data slices associated with the sub-DSN address range to produce one or more rebuilt encoded data slices. The DST EX unit facilitates storage of the rebuilt encoded data slices in the available spare DS memory.