Storage device group split technique for extent pool with hybrid capacity storage devices system and method

US10540103B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-10540103-B1
Application numberUS-201715664730-A
CountryUS
Kind codeB1
Filing dateJul 31, 2017
Priority dateJul 31, 2017
Publication dateJan 21, 2020
Grant dateJan 21, 2020

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method, computer program product, and computer system for initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be marked for at least a portion of the N disks. The target DPG may be marked for E RAID extents, where E is a number of RAID extents in the original DPG. At least a portion of disk extents for the E RAID extents in the original DPG may be moved to the target DPG.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer-implemented method comprising: initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG. 2. The computer-implemented method of claim 1 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG. 3. The computer-implemented method of claim 2 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG. 4. The computer-implemented method of claim 3 further comprising updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal. 5. The computer-implemented method of claim 3 further comprising locating a new disk extent in the target DPG for each disk extent virtually removed. 6. The computer-implemented method of claim 5 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG. 7. The computer-implemented method of claim 6 further comprising allocating the new disk extent in the target DPG for each disk extent virtually removed. 8. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising: initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG. 9. The computer program product of claim 8 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG. 10. The computer program product of claim 9 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG. 11. The computer program product of claim 10 wherein the operations further comprise updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal. 12. The computer program product of claim 10 wherein the operations further comprise locating a new disk extent in the target DPG for each disk extent virtually removed. 13. The computer program product of claim 12 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG. 14. The computer program product of claim 13 wherein the operations further comprise allocating the new disk extent in the target DPG for each disk extent virtually removed. 15. A computing system including one or more processors and one or more memories configured to perform operations comprising: initializing an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout; partitioning N disks in an original disk partner group (DPG) into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities; marking the target DPG for at least a portion of the N disks; marking the target DPG for E RAID extents, where E is a number of RAID extents in the original DPG; and moving at least a portion of disk extents for the E RAID extents in the original DPG to the target DPG, wherein moving the at least a portion of disk extents for the E RAID extents includes moving each disk extent associated with a respective RAID extent such that the respective RAID extent spans a single DPG. 16. The computing system of claim 15 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes selecting a target RAID extent, for each of at least the portion of disk extents, resulting in a balance of free disk extent counts in the original DPG and the target DPG. 17. The computing system of claim 16 wherein moving at least the portion of disk extents for the E RAID extents in the original DPG to the target DPG includes virtually removing from the original DPG any disk extents for the E RAID extents belonging to the target DPG. 18. The computing system of claim 17 wherein the operations further comprise updating the N*N Weighted Neighborhood Matrix based upon, at least in part, the virtual removal. 19. The computing system of claim 17 wherein the operations further comprise locating a new disk extent in the target DPG for each disk extent virtually removed. 20. The computing system of claim 19 wherein locating the new disk extent in the target DPG for each disk extent virtually removed includes locating a valid and optimal disk extent in the target DPG that results in a lowest variance of sub-matrix values for the target DPG.

Assignees

Inventors

Classifications

  • G06F3/0619Primary

    in relation to data integrity, e.g. data losses, bit errors · CPC title

  • Disk arrays, e.g. RAID, JBOD · CPC title

  • Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

  • by allocating resources to storage systems · CPC title

  • at area level, e.g. provisioning of virtual or logical volumes · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10540103B1 cover?
A method, computer program product, and computer system for initializing, on a computing device, an N*N Weighted Neighborhood Matrix according to an existing Mapped RAID layout. N disks in an original disk partner group (DPG) may be partitioned into a target DPG, where N is a number of disks in an extent pool, wherein the N disks have at least two different capacities. The target DPG may be mar…
Who is the assignee on this patent?
Emc Ip Holding Co Llc
What technology area does this patent fall under?
Primary CPC classification G06F3/0619. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 21 2020 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).