Dynamic adjustment of application resources in a distributed computing system
US-10846137-B2 · Nov 24, 2020 · US
US12223183B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12223183-B2 |
| Application number | US-202318528045-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 4, 2023 |
| Priority date | Oct 29, 2015 |
| Publication date | Feb 11, 2025 |
| Grant date | Feb 11, 2025 |
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.
Optimizing copy operations in a storage array, includes combining, in dependence upon a metadata optimization policy, a plurality of copy operations into a single copy operation and splitting the single copy operation into an optimized set of executable copy operations that copy data based on memory alignment.
Opening claim text (preview).
What is claimed is: 1. A method comprising: combining, into a single operation, a plurality of operations based on a metadata boundary at an underlying storage resource that defines a range of addresses of a single metadata block; and from the single operation, creating an optimized set of one or more executable operations that write a particular amount of data that aligns with a memory layout at a target storage location. 2. The method of claim 1 wherein combining, in dependence upon a metadata optimization policy, the plurality of operations into a single operation further comprises: identifying a metadata boundary for an underlying storage resource, the metadata boundary defining a range of addresses within underlying storage resources that are described by a single metadata block; and grouping, within the single operation, all operations that are directed toward the metadata boundary. 3. The method of claim 1 wherein splitting the single operation into an optimized set of executable copy operations further comprises splitting the single operation into one or more copy operations that copy a particular amount of data that aligns with a physical or logical layout of memory on a storage device that data is copied from. 4. The method of claim 1 further comprising: identifying a copy operation group associated with the single operation, wherein: detecting a triggering event associated with a particular copy operation group; and combining the plurality of operations into the single operation further comprises including only operations associated with the particular copy operation group in the single operation. 5. The method of claim 1 , wherein the plurality of operations are copy operations. 6. The method of claim 1 wherein splitting the single operation into an optimized set of executable copy operations further comprises splitting the single operation into one or more copy operations that write an amount of data optimized for transmission across a network. 7. The method of claim 1 wherein the single operation is a virtual copy operation. 8. The method of claim 1 further comprising detecting, as a triggering event, that a number of copy operations received has reached a predetermined number. 9. The method of claim 1 further comprising, detecting, as a triggering event, that a combined size of the plurality of operations has reached a predetermined size threshold. 10. A storage array controller, the storage array controller including a computer processor and a computer memory, the computer memory including computer program instructions that, when executed, cause the storage array controller to carry out the steps of: combining, into a single operation, a plurality of operations based on a metadata boundary at an underlying storage resource that defines a range of addresses of a single metadata block; and from the single operation, creating an optimized set of one or more executable operations that write a particular amount of data that aligns with a memory layout at a target storage location. 11. The storage array controller of claim 10 wherein combining, in dependence upon a metadata optimization policy, the plurality of operations into a single operation further comprises: identifying a metadata boundary for an underlying storage resource, the metadata boundary defining a range of addresses within underlying storage resources that are described by a single metadata block; and grouping, within the single operation, all of the operations that are directed toward the metadata boundary. 12. The storage array controller of claim 10 wherein splitting the single operation into an optimized set of executable copy operations further comprises splitting the single operation into one or more copy operations that copy a particular amount of data that aligns with a physical or logical layout of memory on a storage device that data is copied from. 13. The storage array controller of claim 10 further comprising computer program instructions that, when executed, cause the storage array controller to carry out the steps of: identifying a copy operation group associated with the single operation; detecting a triggering event associated with a particular copy operation group; and combining the plurality of operations into the single operation further comprises including only operations associated with the particular copy operation group in the single operation. 14. The storage array controller of claim 10 further comprising computer program instructions that carry out the step of detecting, as a triggering event, that a predetermined period of time has expired since a most recently received copy operation was received. 15. The storage array controller of claim 10 further comprising computer program instructions that carry out the step of detecting, as a triggering event, that a predetermined period of time has expired since an oldest copy operation was received. 16. The storage array controller of claim 10 , wherein the plurality of operations are copy operations. 17. The storage array controller of claim 10 wherein splitting the single operation into an optimized set of executable copy operations further comprises splitting the single operation into one or more copy operations that write an amount of data optimized for transmission across a network. 18. The storage array controller of claim 10 wherein the single operation is a virtual copy operation. 19. A computer program product, the computer program product disposed on a computer readable storage medium, the computer program product comprising computer program instructions that, when executed, cause a storage device to carry out the steps of: combining, in dependence upon a metadata optimization policy, a plurality of operations into a single operation; and splitting the single operation into an optimized set of one or more executable copy operations that write a particular amount of data that aligns with a physical or logical layout of memory at a target storage location. 20. The computer program product of claim 19 wherein combining, in dependence upon a metadata optimization policy, the plurality of operations into a single operation further comprises: identifying a metadata boundary for an underlying storage resource, the metadata boundary defining a range of addresses within underlying storage resources that are described by a single metadata block; and grouping, within the single operation, all operations that are directed toward the metadata boundary.
at area level, e.g. provisioning of virtual or logical volumes · CPC title
Plurality of storage devices · CPC title
Replication mechanisms · CPC title
Improving I/O performance · 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.