Algorithmic location of raid groups and spare capacity for granular expansion
AssigneeDell Products L.P.
InventorsKuolin Hua, Kunxiu Gao
Life of this patent
Estimating the term…
Loading patent…
AssigneeDell Products L.P.
InventorsKuolin Hua, Kunxiu Gao
Estimating the term…
A minimal cluster of G+1 disks with G same-size cells has protection group members distributed in accordance with a deterministic algorithm such that the cell at disk X, cell Y is assigned to group (X+Y−1) modulo M, where M is group size (G) plus 1 and one of the groups is reserved as spare capacity for recovering from drive failure. The cluster can be granularly expanded and eventually split into a non-flex cluster and a flex cluster that begins with the member distribution pattern of the deterministic algorithm. Relocations of members during expansion and split are achieved in part by submatrix transposition and reordering of disks.
A method, comprising:
An apparatus, comprising:
A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for using a computer system to create and distribute spare capacity, the method comprising:
Dependencies are inferred from the claim text.