Storage resource management employing performance analytics
US-9971548-B1 · May 15, 2018 · US
US12182408B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12182408-B2 |
| Application number | US-202217726028-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 21, 2022 |
| Priority date | Apr 21, 2022 |
| Publication date | Dec 31, 2024 |
| Grant date | Dec 31, 2024 |
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 method, computer program product, and computing system for dividing a total IO flow rate limit between a plurality of storage nodes of a multi-node storage system. A total desired IO flow rate may be determined. Each storage node of the plurality of storage nodes may be queried for a desired IO flow rate, thus defining a plurality of desired IO flow rates. An updated IO flow rate limit may be defined, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates. One or more IO requests may be processed on the plurality of storage nodes based upon, at least in part, the updated IO flow rate limit defined for each storage node and the total desired IO flow rate.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method, executed on a computing device, comprising: dividing a total IO flow rate limit between a plurality of storage nodes of a multi-node storage system, wherein the total IO flow rate limit as a total IO flow rate between a storage object and the plurality of storage nodes and is defined per storage object accessible by each of the plurality of storage nodes, thus defining a plurality of IO flow rate limits; determining a total desired IO flow rate; querying each storage node of the plurality of storage nodes for a desired IO flow rate, thus defining a plurality of desired IO flow rates; defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates; and processing one or more IO requests on the plurality of storage nodes based upon, at least in part, the updated IO flow rate limit defined for each storage node and the total desired IO flow rate includes processing the one or more IO requests on at least one storage node of the plurality of storage nodes at the updated IO flow rate by multiplying the total desired IO flow rate by the desired IO flow rate for the at least one storage node and limiting a resulting IO flow rate by the updated IO flow rate limit for the at least one storage node. 2. The computer-implemented method of claim 1 , wherein the multi-node storage system includes two storage nodes configured in an active-active system. 3. The computer-implemented method of claim 1 , wherein dividing a total IO flow rate limit between a plurality of storage nodes of a storage system includes: dividing the total IO flow rate limit equally between a plurality of storage nodes of a storage system. 4. The computer-implemented method of claim 1 , wherein querying each storage node of the plurality of storage nodes for a desired IO flow rate includes: querying each storage node of the plurality of storage nodes for the desired IO flow rate at a predefined interval. 5. The computer-implemented method of claim 1 , wherein querying each storage node of the plurality of storage nodes for a desired IO flow rate includes: querying each storage node of the plurality of storage nodes for the desired IO flow rate in response to detecting a storage node failure. 6. The computer-implemented method of claim 1 , wherein defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates includes: incrementally adjusting, for each storage node, the IO flow rate limit toward the updated IO flow rate limit. 7. The computer-implemented method of claim 1 , wherein defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates includes: incrementally adjusting the plurality of updated IO flow rate limits toward a plurality of equal IO flow rate limits. 8. A computer program product residing on a non-transitory computer readable medium having a plurality of instructions stored thereon which, when executed by a processor, cause the processor to perform operations comprising: dividing a total IO flow rate limit between a plurality of storage nodes of a multi-node storage system, wherein the total IO flow rate limit as a total IO flow rate between a storage object and the plurality of storage nodes and is defined per storage object accessible by each of the plurality of storage nodes, thus defining a plurality of IO flow rate limits; determining a total desired IO flow rate; querying each storage node of the plurality of storage nodes for a desired IO flow rate, thus defining a plurality of desired IO flow rates; defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates; and processing one or more IO requests on the plurality of storage nodes based upon, at least in part, the updated IO flow rate limit defined for each storage node and the total desired IO flow rate includes processing the one or more IO requests on at least one storage node of the plurality of storage nodes at the updated IO flow rate by multiplying the total desired IO flow rate by the desired IO flow rate for the at least one storage node and limiting a resulting IO flow rate by the updated IO flow rate limit for the at least one storage node. 9. The computer program product of claim 8 , wherein the multi-node storage system includes two storage nodes configured in an active-active system. 10. The computer program product of claim 8 , wherein dividing a total IO flow rate limit between a plurality of storage nodes of a storage system includes: dividing the total IO flow rate limit equally between a plurality of storage nodes of a storage system. 11. The computer program product of claim 8 , wherein querying each storage node of the plurality of storage nodes for a desired IO flow rate includes: querying each storage node of the plurality of storage nodes for the desired IO flow rate at a predefined interval. 12. The computer program product of claim 8 , wherein querying each storage node of the plurality of storage nodes for a desired IO flow rate includes: querying each storage node of the plurality of storage nodes for the desired IO flow rate in response to detecting a storage node failure. 13. The computer program product of claim 8 , wherein defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates includes: incrementally adjusting, for each storage node, the IO flow rate limit toward the updated IO flow rate limit. 14. The computer program product of claim 8 , wherein defining, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates includes: incrementally adjusting the plurality of updated IO flow rate limits toward a plurality of equal IO flow rate limits. 15. A computing system comprising: a memory; and a processor configured to divide a total IO flow rate limit between a plurality of storage nodes of a multi-node storage system, thus defining a plurality of IO flow rate limits, wherein the total IO flow rate limit as a total IO flow rate between a storage object and the plurality of storage nodes and is defined per storage object accessible by each of the plurality of storage nodes, wherein the processor is further configured to determine a total desired IO flow rate, wherein the processor is further configured to query each storage node of the plurality of storage nodes for a desired IO flow rate, thus defining a plurality of desired IO flow rates, wherein the processor is further configured to define, for each storage node, an updated IO flow rate limit based upon, at least in part, the total IO flow rate limit and the plurality of desired IO flow rates, and wherein the processor is further configured to process one or more IO requests on the plurality of storage nodes based upon, at least in part, the updated IO flow rate limit defined for each storage node and the total desired IO flow rate which includes processing the one or more IO requests on at least one storage node of the plurality of storage nodes at the updated IO flow rate by multiplying the total desired IO flow rate by the desired IO flow rate for the at least one storage node and limiting a resulting IO flow rate by the
Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title
Single storage device · CPC title
Monitoring storage devices or systems · CPC title
by allocating resources to storage systems · CPC title
Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.