CYCLIC POINT-IN-TIME-COPY ARCHITECTURE WITH DATA DEDUPLICATION

• US 20120233430A1
• Filed: 03/08/2011
• Published: 09/13/2012
• Est. Priority Date: 03/08/2011
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Benhase, Michael T., Brown, Theresa M., Gupta, Lokesh M., Mellgren, Carol S.
• Granted Patent: US 8,782,362 B2
• Time in Patent Office: Days
• US Class Current: 711/165
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/067 Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]

Abstract

A method for performing a write to a volume x in a cyclic point-in-time-copy architecture is described. In one embodiment, such a method includes determining whether the volume x has a child volume. The method then determines whether the target bit maps (TBMs) of both the volume x and the child volume are set. If the TBMs are set, the method finds a higher source (HS) volume from which to copy the desired data to the child volume. Once the HS volume is found, the method determines whether the HS volume and the child volume are the same volume. If the HS volume and the child volume are not the same volume, the method copies the data from the HS volume to the child volume. The method then performs the write to the volume x. A corresponding computer program product is also described.

Claims

1-7. -7. (canceled)

8. A computer program product for performing a write to a volume x in a cyclic point-in-time-copy architecture, the computer program product comprising a computer-readable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising:

computer-usable program code to determine whether the volume x has a child volume, wherein each of the volume x and the child volume have a target bit map (TBM) associated therewith;

computer-usable program code to determine whether the TBMs of both the volume x and the child volume are set;

computer-usable program code to, if the TBMs are set, find a higher source (HS) volume from which to copy data to the child volume, wherein finding the HS volume comprises traveling up the cyclic architecture until the source of the data is found;

computer-usable program code to determine whether the HS volume and the child volume are the same volume;

computer-usable program code to copy the data from the HS volume to the child volume if the HS volume and the child volume are not the same volume; and

computer-usable program code to perform the write on the volume x.

9. The computer program product of claim 8, wherein finding the HS volume further comprises finding the source volume associated with the volume x.

10. The computer program product of claim 9, wherein finding the source volume further comprises determining the mapping relationship between the volume x and the source volume.

11. The computer program product of claim 10, wherein the mapping relationship is defined by a generation number (GN) associated with the volume x and a generation number (GN) associated with the source volume.

12. The computer program product of claim 10, further comprising computer-usable program code to determine that the source volume is the HS volume if at least one of the following is true:

(a) the source volume is not also a target volume;

(b) a TBM associated with the source volume is not set; and

(c) the mapping relationship was created prior to an upstream mapping relationship.

13. The computer program product of claim 8, further comprising computer-usable program code to, if the TBM of the child volume is set and the TBM of the volume x is not set, copy data from the volume x to the child volume.

14. The computer program product of claim 8, further comprising computer-usable program code to, if the TBM of the child volume is not set, not copy data to the child volume.