Distributed RAID Rebuild via Segmented Computation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional RAID rebuild methods require a single node to perform extensive computations, leading to high network bandwidth demands and potentially lengthy rebuild times, which can result in data loss due to insufficient bandwidth or the need to starve other critical network traffic.

Innovation Solution

A distributed approach where a lead node directs other computing nodes to generate partial rebuild results, reducing the amount of data that needs to be transmitted back to the lead node, allowing for faster rebuilds and parallel processing to alleviate bandwidth bottlenecks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If a single node performs all rebuild computations, then the rebuild process is simple to manage, but network bandwidth requirements increase significantly and rebuild time increases

Engineering Contradiction:
Improverebuild management complexityVSAvoidnetwork bandwidth consumption
Core Design Contradiction:
Device complexityVSQuantity of substance

Solution Approach 1:

The patent divides the rebuild computation task into multiple segments, with each computing node responsible for calculating a portion of the rebuild data based on its local drives. This segmentation distributes the computational load and reduces the amount of data that needs to be transmitted over the network, as each node only sends its computed segment to the lead node rather than all nodes sending complete rebuild data.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If a single node performs all rebuild computations, then coordination is simplified, but rebuild time increases which increases risk of multiple drive failures

Engineering Contradiction:
Improverebuild coordination complexityVSAvoidrebuild time
Core Design Contradiction:
Device complexityVSLoss of time

Solution Approach 1:

The rebuild process is segmented into parallel computation tasks distributed across multiple nodes. Each node independently computes its assigned segment simultaneously, reducing overall rebuild time compared to sequential processing by a single node, while the lead node coordinates the segmented results to reconstruct the complete failed drive data.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent enables continuous useful action during rebuild by allowing multiple nodes to perform computations simultaneously and in parallel rather than sequentially. This continuous parallel processing maintains high utilization of computing resources and minimizes idle time, thereby reducing total rebuild time and the associated risk of additional drive failures.

Inventive Principle:
Principle #20Continuity of useful action

3Loss of time

If sufficient network bandwidth is allocated for fast rebuild, then rebuild time decreases, but other critical network traffic such as drive I/O is starved

Engineering Contradiction:
Improverebuild timeVSAvoidnormal drive I/O performance
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

By segmenting the rebuild computation across multiple nodes, the patent reduces the network bandwidth required for each individual transmission. Each node only transmits its computed segment rather than complete rebuild data, allowing rebuild operations to proceed without monopolizing network bandwidth and thus preventing starvation of other critical traffic like drive I/O operations.

Inventive Principle:
Principle #1Segmentation

4Quantity of substance

If distributed parallel rebuild computation is used, then network bandwidth requirements decrease and rebuild speed increases, but system complexity increases

Engineering Contradiction:
Improvenetwork bandwidth consumptionVSAvoiddistributed system complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The lead node serves as an intermediary that coordinates the distributed rebuild computation. It receives segments from other nodes, combines them, and produces the final rebuild output. This intermediary approach simplifies the complexity of distributed coordination by centralizing the integration logic while still benefiting from the bandwidth efficiency of distributed computation.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS11593206B2Distributed raid rebuild
Publication Date: 2023.02.28 EMC IP HLDG CO LLC
  • US11593206B2 patent drawing
  • US11593206B2 patent drawing
  • US11593206B2 patent drawing

AI summary

A technique is disclosed for generating rebuild data of a RAID configuration having one or more failed drives. The RAID configuration includes multiple sets of drives coupled to respective computing nodes, and the computing nodes are coupled together via a network. A lead node directs rebuild activities, communicating with the other node or nodes and directing such node(s) to compute partial rebuild results. The partial rebuild results are based on data of the drives of the RAID configuration coupled to the other node(s). The lead node receives the partial rebuild results over the network and computes complete rebuild data based at least in part on the partial rebuild results.