System and method of backup grouping with improved computational efficiency
US-2020125262-A1 · Apr 23, 2020 · US
US11442816B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11442816-B2 |
| Application number | US-201816208371-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 3, 2018 |
| Priority date | Dec 3, 2018 |
| Publication date | Sep 13, 2022 |
| Grant date | Sep 13, 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 computer-implemented method according to one embodiment includes receiving a plurality of backup requests at a data storage system having a data storage library. At least some of the backup requests have unique service-metadata associated therewith. Each backup request is placed in a backup queue, where an ordering of the backup requests within the backup queue is based at least in part on the service-metadata. Backup operations are performed on the data storage system in accordance with the ordering of the backup requests within the backup queue. A computer program product for determining resource allocation in a backup environment according to another embodiment includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method, comprising: receiving a plurality of backup requests at a data storage system having a data storage library, at least some of the backup requests having unique service-metadata associated therewith, wherein the data storage library is divided into at least two logical libraries, the backup requests being serviced by one of the logical libraries; placing each backup request in a backup queue, wherein an ordering of the backup requests within the backup queue is based at least in part on the unique service-metadata associated with the at least some of the backup requests, wherein placing each backup request in the backup queue includes determining a group to which the backup request belongs, a group ranking of the group, and a sub-ranking for each of the backup requests within each group, wherein each group ranking is determined from service level data of the unique service-metadata associated with the at least some backup requests, wherein each sub-ranking is determined based on a sub-ranking priority value calculated using the unique service-metadata associated with the at least some backup requests; performing backup operations on the data storage system according to the ordering of the backup requests within the backup queue; and in response to a determination that a sub-ranking priority value of a first backup request is greater than a predetermined threshold priority value, recruiting an unused drive from another of the logical libraries to assist in performing a backup operation corresponding to the first backup request. 2. The computer-implemented method of claim 1 , wherein the unique service-metadata associated with the at least some backup requests includes information that is selected from the group consisting of: measured actual wait time, max wait time, measured run time, and total backup volume. 3. The computer-implemented method of claim 1 , wherein the sub-ranking priority value is determined using the following equation: sub-ranking priority value=A1(1−(actual wait time/max wait time))+A2((1−mount time)/backup run time)), Equation (1) where “A1” and “A2” are any predefined constant values. 4. The computer-implemented method of claim 1 , comprising: in response to the determination that the sub-ranking priority value of the first backup request is greater than the predetermined threshold priority value, terminating a running backup request, wherein the running backup request has a lower sub-ranking priority value than the sub-ranking priority value of the first backup request. 5. The computer-implemented method of claim 1 , comprising: in response to the determination that the sub-ranking priority value of the first backup request is greater than the predetermined threshold priority value, canceling a housekeeping operation within the data storage library for freeing a drive; assigning the first backup request to the freed drive; and scheduling the cancelled housekeeping operation for when the backup queue has been emptied, wherein the housekeeping operation includes a garbage collection operation. 6. The computer-implemented method of claim 1 , wherein the unique service-metadata associated with the at least some backup requests is assigned by a backup client sending the backup requests prior to receiving the plurality of backup requests at the data storage system. 7. A computer program product for determining resource allocation in a backup environment, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable and/or executable by a computer to cause the computer to: receive, by the computer, a plurality of backup requests at a data storage system having a data storage library, at least some of the backup requests having unique service-metadata associated therewith, wherein the data storage library is divided into at least two logical libraries, the backup requests being serviced by one of the logical libraries, wherein the logical libraries are located across more than one physical library frame; place, by the computer, each backup request in a backup queue, wherein an ordering of the backup requests within the backup queue is based at least in part on the unique service-metadata associated with the at least some backup requests, wherein placing each backup request in the backup queue includes determining, by the computer, a group to which the backup request belongs, a group ranking of the group, and a sub-ranking for each of the backup requests within each group, wherein each group ranking is determined from service level data of the unique service-metadata associated with the at least some backup requests, wherein each sub-ranking is determined based on a sub-ranking priority value calculated using the unique service-metadata; perform, by the computer, backup operations on the data storage system according to the ordering of the backup requests within the backup queue; and in response to a determination that a sub-ranking priority value of a first backup request is greater than a predetermined threshold priority value, recruiting, by the computer, an unused drive from another of the logical libraries to assist in performing a backup operation corresponding to the first backup request. 8. The computer program product of claim 7 , wherein the unique service-metadata associated with the at least some backup requests includes information that is selected from the group consisting of: measured actual wait time, max wait time, measured run time, and total backup volume. 9. The computer program product of claim 7 , wherein the sub-ranking priority value is determined, by the computer, using the following equation: sub-ranking priority value=A1(1−(actual wait time/max wait time))+A2((1−mount time)/backup run time)), Equation (1) where “A1” and “A2” are any predefined constant values. 10. The computer program product of claim 7 , the program instructions readable and/or executable by the computer to cause the computer to: in response to the determination that the sub-ranking priority value of the first backup request is greater than the predetermined threshold priority value, terminating, by the computer, a running backup request, wherein the running backup request has a lower sub-ranking priority value than the sub-ranking priority value of the first backup request. 11. The computer program product of claim 10 , wherein the running backup request has a largest remaining backup time of running backup requests. 12. The computer program product of claim 7 , the program instructions readable and/or executable by the computer to cause the computer to: in response to the determination that the sub-ranking priority value of the first backup request is greater than the predetermined threshold priority value, canceling, by the computer, a housekeeping operation within the data storage library for freeing a drive, and assigning the first backup request to the drive. 13. The computer program product of claim 7 , wherein the unique service-metadata associated with the at least some backup requests is assigned by a backup client sending the backup requests. 14. A system, comprising: a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: receive a plurality of backup requests at a data storage system having a data storage library, at least some of the backup requests having unique service-metadata associated therewith, wherein the data stor
Migration mechanisms · CPC title
Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title
Threshold · CPC title
for performance assessment · CPC title
Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.