RAID-based globally resource-shared data storage system
US-10997025-B2 · May 4, 2021 · US
US11216198B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11216198-B2 |
| Application number | US-201916582476-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 25, 2019 |
| Priority date | Oct 30, 2018 |
| Publication date | Jan 4, 2022 |
| Grant date | Jan 4, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A technique involves: in response to receiving a first request for adjusting a first width of a disk array to a second width, obtaining, based on source identification information of a source stripe group in the disk array in the first request, source block identification information of a source block associated with the source stripe group. The technique further involves: determining destination identification information of a destination stripe group associated with the second width for storing data. The technique further involves: storing, based on the source identification information and the destination identification information, source data and metadata for the source data from the source block into a destination block of the destination stripe group, the metadata including node identification information for accessing nodes of the source block. The technique further involves: adjusting the node to access the destination block based on the node identification information.
Opening claim text (preview).
We claim: 1. A method of data processing, comprising: in response to receiving a first request for adjusting a first width of a disk array to a second width, obtaining, based on source identification information of a source stripe group in the disk array in the first request, source block identification information of a source block associated with the source stripe group; determining destination identification information of a destination stripe group associated with the second width for storing data; storing, based on the source block identification information and the destination identification information, source data and metadata for the source data from the source block into a destination block of the destination stripe group, the metadata including node identification information for accessing nodes of the source block; and adjusting at least one node in a mapping between logical addresses and physical addresses to access the destination block based on the node identification information, at least in part by modifying source block identification information of the source block in the node to destination block identification information of the destination block, wherein the mapping between logical addresses and physical addresses comprises a B+tree that is used to map at least one address in at least user request to physical space, and wherein the mapping is within a mapper that received, from the disk array, the first request for adjusting the first width of the disk array to the second width. 2. The method of claim 1 , wherein determining destination identification information of a destination stripe group associated with the second width for storing data comprises: sending to the disk array a second request for obtaining the destination stripe group; and receiving, from the disk array, the destination identification information of the destination stripe group determined based on the second request. 3. The method of claim 1 , wherein storing source data and metadata for the source data from the source block into a destination block of the destination stripe group comprises: obtaining, from the disk array, the source data and the metadata associated with the source block based on the source block identification information; and storing, based on the destination identification information, the source data and the metadata into the destination block in the destination stripe group. 4. The method of claim 1 , wherein adjusting the node to access the destination block further comprises: determining the node based on the node identification information. 5. The method of claim 1 , further comprising: in response to an Input/Output (I/O) request hitting the source data in the source block being processed, queuing the I/O request. 6. The method of claim 1 , further comprising: in response to an adjustment for a width of the source stripe group being completed, sending the destination identification information to the disk array to replace the source identification information in a mapping related to the source stripe group. 7. An electronic device for data processing, comprising: a processor; and a memory having computer program instructions stored thereon, the processor executing the computer program instructions in the memory to control the electronic device to perform acts including: in response to receiving a first request for adjusting a first width of a disk array to a second width, obtaining, based on source identification information of a source stripe group in the disk array in the first request, source block identification information of a source block associated with the source stripe group; determining destination identification information of a destination stripe group associated with the second width for storing data; storing, based on the source block identification information and the destination identification information, source data and metadata for the source data from the source block into a destination block of the destination stripe group, the metadata including node identification information for accessing nodes of the source block; and adjusting at least one node in a mapping between logical addresses and physical addresses to access the destination block based on the node identification information, at least in part by modifying source block identification information of the source block in the node to destination block identification information of the destination block, wherein the mapping between logical addresses and physical addresses comprises a B+tree that is used to map at least one address in at least user request to physical space, and wherein the mapping is within a mapper that received, from the disk array, the first request for adjusting the first width of the disk array to the second width. 8. The electronic device of claim 7 , wherein determining destination identification information of a destination stripe group associated with the second width for storing data comprises: sending to the disk array a second request for obtaining the destination stripe group; and receiving, from the disk array, the destination identification information of the destination stripe group determined based on the second request. 9. The electronic device of claim 7 , wherein storing source data and metadata for the source data from the source block into a destination block of the destination stripe group comprises: obtaining, from the disk array, the source data and the metadata associated with the source block based on the source block identification information; and storing, based on the destination identification information, the source data and the metadata into the destination block in the destination stripe group. 10. The electronic device of claim 7 , wherein adjusting the node to access the destination block further comprises: determining the node based on the node identification information. 11. The electronic device of claim 7 , wherein the acts further comprise: in response to an Input/Output (I/O) request hitting the source data in the source block being processed, queuing the I/O request. 12. The electronic device of claim 7 , wherein the acts further comprise: in response to an adjustment for a width of the source stripe group being completed, sending the destination identification information to the disk array to replace the source identification information in a mapping related to the source stripe group. 13. A computer program product having a non-transitory computer readable medium which stores a set of instructions to perform data processing; the set of instructions, when carried out by computerized circuitry, causing the computerized circuitry to perform a method of: in response to receiving a first request for adjusting a first width of a disk array to a second width, obtaining, based on source identification information of a source stripe group in the disk array in the first request, source block identification information of a source block associated with the source stripe group; determining destination identification information of a destination stripe group associated with the second width for storing data; storing, based on the source block identification information and the destination identification information, source data and metadata for the source data from the source block into a destination block of the destination stripe group, the metadata including node identification information for accessing nodes of the source block; and adjusting at least one node in a mapping between logical addresses and physical addresses to access the destination block based on the node identifi
Disk arrays, e.g. RAID, JBOD · CPC title
in relation to response time · CPC title
Management of blocks · CPC title
Improving I/O performance · CPC title
by allocating resources to storage systems · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.