Information processing system and path management method
US-2019310925-A1 · Oct 10, 2019 · US
US11269770B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11269770-B2 |
| Application number | US-201916579981-A |
| Country | US |
| Kind code | B2 |
| Filing date | Sep 24, 2019 |
| Priority date | Oct 30, 2018 |
| Publication date | Mar 8, 2022 |
| Grant date | Mar 8, 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.
Techniques involve managing a storage space. In response to receiving an allocation request for allocating a storage space, a storage space size and a slice size are obtained. A first storage system and a second storage system are selected from multiple storage systems, the first storage system and the second storage system includes a first storage device group and a second storage device group respectively, and the first storage device group does not overlap the second storage device group. A first slice group and a second slice group is obtained from the first storage system and the second storage system respectively, on the basis of the size of the storage space and the size of the slice. A user storage system is built at least on the basis of the first slice group and the second slice group, so as to respond to the allocation request.
Opening claim text (preview).
We claim: 1. A method for managing a storage space, comprising: in response to receiving an allocation request for allocating a storage space, obtaining a size of a storage space and a size of a slice in the storage space which are specified by the allocation request; selecting a first storage system and a second storage system from multiple storage systems across which the storage space is provided, the first storage system and the second storage system comprising a first group of storage devices and a second group of storage devices respectively, and the first group of storage devices not overlapping the second group of storage devices, each of the first storage system and second storage system including two or more respective control nodes providing parallel access to the respective group of storage devices of the respective storage system; obtaining a first group of slices and a second group of slices from the first storage system and the second storage system respectively, on the basis of the size of the storage space and the size of the slice; and building a user storage system at least on the basis of the first group of slices and the second group of slices, so as to respond to the allocation request; maintaining a per-slice recommended path table having a plurality of entries, each entry associating a respective individual slice with a corresponding recommended path to a corresponding storage system on which the slice resides; and in response to a access request for a target slice residing on a corresponding target storage system, determining whether the per-slice recommended path table includes a recommended path for the target slice, and if so then using the recommended path to route the access request to the target storage system, and otherwise identifying and using an alternative path to route the access request to the target storage system. 2. The method of claim 1 , wherein building a user storage system at least on the basis of the first group of slices and the second group of slices comprises: building an address mapping of the user storage system, the address mapping comprising a mapping relationship between each slice in the user storage system and a storage system where each slice resides. 3. The method of claim 1 , wherein obtaining a first group of slices and a second group of slices from the first storage system and the second storage system respectively comprises: obtaining a first workload and a second workload of the first storage system and the second storage system respectively; and selecting the first group of slices and the second group of slices on the basis of the first workload and the second workload. 4. The method of claim 3 , wherein the first workload comprises at least any of a storage resource service load or an access load of the first storage system. 5. The method of claim 1 , further comprising: in response to receiving an expansion request for expanding the user storage system, obtaining the size of an expanded space specified by the expansion request; selecting a third storage system from the multiple storage systems, the third storage system comprising a third group of storage devices; obtaining a third group of slices from the third storage system on the basis of the size of the expanded space and the size of the slice; and expanding the user storage system at least on the basis of the third group of slices, so as to respond to the expansion request. 6. The method of claim 1 , wherein each recommended path is determined from a corresponding set of candidate paths, and wherein maintaining the per-slice recommended path table includes: regarding a slice in the user storage system, obtaining multiple candidate paths for accessing the slice, wherein an access server of the user storage system is connected to one of the control nodes of the first storage system via a group of ports respectively, the control nodes being used to access data in the first storage system, a candidate path of the multiple candidate paths comprising a port in the group of ports and a control node among the control nodes. 7. The method of claim 6 , wherein identifying and using an alternative path includes: accessing the target slice via a candidate path of the multiple candidate paths. 8. The method of claim 6 , wherein the recommended path is determined from the set of candidate paths by: in response to determining that a candidate path guides an access request to the target storage system where the target slice resides, identifying the candidate path as the recommended path. 9. The method of claim 8 , wherein accessing the target slice via a candidate path of the multiple candidate paths comprises: in response to determining the candidate path fails to guide the access request to a target storage system where the target slice resides, forwarding the access request to the target storage system so that the target storage system responds to the access request. 10. The method of claim 9 , further comprising: in response to receiving a further access request for the target slice, obtaining a further candidate path of the multiple candidate paths; and accessing the target slice via the further candidate path. 11. An apparatus for managing a storage space, comprising: at least one processor; a volatile memory; and a memory coupled to the at least one processor and having instructions stored thereon, the instructions, when executed by the at least one processor, causing the apparatus to perform acts comprising: in response to receiving an allocation request for allocating a storage space, obtaining a size of a storage space and a size of a slice in the storage space which are specified by the allocation request; selecting a first storage system and a second storage system from multiple storage systems across which the storage space is provided, the first storage system and the second storage system comprising a first group of storage devices and a second group of storage devices respectively, and the first group of storage devices not overlapping the second group of storage devices, each of the first storage system and second storage system including two or more respective control nodes providing parallel access to the respective group of storage devices of the respective storage system; obtaining a first group of slices and a second group of slices from the first storage system and the second storage system respectively, on the basis of the size of the storage space and the size of the slice; building a user storage system at least on the basis of the first group of slices and the second group of slices, so as to respond to the allocation request; maintaining a per-slice recommended path table having a plurality of entries, each entry associating a respective individual slice with a corresponding recommended path to a corresponding storage system on which the slice resides; and in response to a access request for a target slice residing on a corresponding target storage system, determining whether the per-slice recommended path table includes a recommended path for the target slice, and if so then using the recommended path to route the access request to the target storage system, and otherwise identifying and using an alternative path to route the access request to the target storage system. 12. The apparatus of claim 11 , wherein building a user storage system at least on the basis of the first group of slices and the second group of slices comprises: building an address mapping of the user storage system, the address mapping comprising a mapping relationship between each slice in the user storage system and a storage system wh
Configuration or reconfiguration of storage systems · CPC title
in relation to response time · CPC title
Non-volatile semiconductor memory arrays · CPC title
Configuration or reconfiguration · CPC title
Address space extension · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.