IP Library Granted Patent US 10,268,401
Granted Patent B2
US 10,268,401 · App. 15/421,517 · Granted Apr 23, 2019

Backup consolidation

Inventors: Bernhard J. Klingenberg (Grover Beach, CA); Steven M. Reps (Sandy Hook, CT); Kurt A. Rybczyk (Waterbury, CT); Lisa A. Shepard (Newtown, CT)
Assignee: International Business Machines Corporation
G06F3/0619G06F3/0647G06F3/0686
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,268,401
App. No.
15/421,517
Granted
Apr 23, 2019
Kind
B2
Abstract

A method, computer system and computer program product for managing tapes storing a backup for a node. The method identifies the node for which a current set of tapes is present. The method determines whether the current set of tapes exceeds a threshold for undesired fragmentation for the node and moves data in the current set of tapes to a new set of tapes when a physical tape count exceeds the threshold for undesired fragmentation, wherein the data is more contiguous in the new set of tapes than the current set of tapes.

Claims (39)

1. A method for managing tapes storing a backup for a node, the method comprising:

identifying, by a computer system, the node for which a current set of tapes is present;

determining, by the computer system, whether a physical tape count for the current set of tapes exceeds a threshold for undesired fragmentation for the node; and

moving, by the computer system, data in the current set of tapes to a new set of tapes when the physical tape count exceeds the threshold for undesired fragmentation, wherein the data is more contiguous in the new set of tapes than in the current set of tapes.

2. The method of claim 1 further comprising:

identifying a fragmentation for a set of tapes as follows:

Frag= N /( A/C )

where Frag is fragmentation; N is a number tapes used; A is an amount of storage needed for the data backed up for the node; and C is a tape capacity.

3. The method of claim 1 , wherein determining whether the physical tape count exceeds the threshold for undesired fragmentation for the node comprises:

determining whether an amount of time needed to restore the data from the current set of tapes is greater than a time threshold for restoring the data.

4. The method of claim 3 , wherein the amount of time is set using at least one of a service level agreement, a recovery objective, a role of the node, or a type of restore.

5. The method of claim 1 , wherein the threshold is set on a per node basis.

6. The method of claim 1 , wherein the current set of tapes is for a portion of the node.

7. The method of claim 6 , wherein the portion of the node is selected from a group comprising a drive, a directory, active data, inactive data, all data, and a virtual computer, and all data.

8. The method of claim 1 , wherein the node is selected from a group comprising a physical node and a virtual node.

9. A computer system comprising:

a processor unit; and

a tape manager running on the processor unit, wherein the tape manager identifies a node for which a current set of tapes are present; determines whether a physical tape count for the current set of tapes exceeds a threshold for undesired fragmentation for the node; and moves data in the current set of tapes to a new set of tapes when the physical tape count exceeds the threshold for undesired fragmentation, wherein the data is more contiguous in the new set of tapes than in the current set of tapes.

10. The computer system of claim 9 , wherein the tape manager identifies a fragmentation for a set of tapes as follows:

Frag= N /( A/C )

where Frag is fragmentation; N is a number tapes used; A is an amount of storage needed for the data backed up for the node; and C is a tape capacity.

11. The computer system of claim 9 , wherein in determining whether the physical tape count exceeds the threshold for undesired fragmentation for the node, the tape manager determines whether an amount of time needed to restore the data from the current set of tapes is greater than a time threshold for restoring the data.

12. The computer system of claim 11 , wherein the amount of time is set using at least one of a service level agreement, a recovery objective, a role of the node, or a type of restore.

13. The computer system of claim 9 , wherein the threshold is set on a per node basis.

14. The computer system of claim 9 , wherein the current set of tapes is for a portion of the node.

15. The computer system of claim 14 , wherein the portion of the node is selected from a group comprising a drive, a directory, active data, inactive data, all data, and a virtual computer, and all data.

16. The computer system of claim 9 , wherein the node is selected from a group comprising a physical node and a virtual node.

17. A computer program product for managing tapes storing a backup for a node, the computer program product comprising:

a computer-readable storage media;

a first program code, stored on the computer-readable storage media, for identifying a node for which a current set of tapes are present;

a second program code, stored on the computer-readable storage media, for determining whether a physical tape count for the current set of tapes exceeds a threshold for undesired fragmentation for the node; and

a third program code, stored on the computer-readable storage media, for moving data in the current set of tapes to a new set of tapes when the physical tape count exceeds the threshold for undesired fragmentation, wherein the data is more contiguous in the new set of tapes than in the current set of tapes.

18. The computer program product of claim 17 further comprising:

A fourth program code, stored on the computer-readable storage media, for identifying a fragmentation for a set of tapes as follows:

Frag= N /( A/C )

where Frag is fragmentation; N is a number tapes used; A is an amount of storage needed for the data backed up for the node; and C is a tape capacity.

19. The computer program product of claim 17 , wherein the second program code comprises:

program code, stored on the computer-readable storage media, for determining whether an amount of time needed to restore data from the current set of tapes is greater than a time threshold for restoring the data.

20. The computer program product of claim 19 , wherein the amount of time is set using at least one of a service level agreement, a recovery objective, a role of the node, or a type of restore.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 13, 2021
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: KYNDRYL, INC.
Reel/Frame 057885/0644 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2017
From: KLINGENBERG, BERNHARD J.; REPS, STEVEN M.; RYBCZYK, KURT A.; SHEPARD, LISA A.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 041143/0147 →
Continuity (1)
Related Publication 20180217767A1 · Aug 2, 2018