Transforming unrelated data volumes into related data volumes
First Claim
Patent Images
1. A method comprising:
- writing first and second data to first and second data volumes, respectively, whereinthe first data volume is a first primary volume,the second data volume is a second primary volume, andthe first and second data volumes are unrelated data volumes;
refreshing the second data volume to the data contents of the first data volume that existed at time T, wherein refreshing the second data volume further comprises overwriting data of the second data volume with data of the first data volume that existed at time T,generating first and second maps in memory, whereineach of the first and second maps comprisesa plurality of entries, wherein
each entry of the first map corresponds to a respective memory block that stores data of the first data volume, and
each entry of the second map corresponds to a respective memory block that stores data of the second data volume,setting a first bit in each entry of the first map, whereineach first bit of the first map is set to indicate its respective memory block stores valid data, andclearing a first bit in each entry of the second map, whereineach first bit of the second map is set to indicate its respective memory block stores invalid data;
modifying data of the first data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T;
modifying data of the second data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T; and
modifying data of the first data volume after the second data volume has been refreshed.
9 Assignments
0 Petitions
Accused Products
Abstract
Disclosed is an apparatus and method for transforming unrelated data volumes into related data volumes. The present invention is employed after creation of first and second unrelated data volumes. In one embodiment, the second data volume is refreshed to the data contents of the first data volume so that the second data becomes a PIT copy of the first data volume. Refreshing the second data volume includes overwriting all data of the second data volume with data copied from the first data volume. However, before all data of the second data volume is overwritten with data copied from the first data volume, data of the first data volume can be modified.
47 Citations
17 Claims
-
1. A method comprising:
-
writing first and second data to first and second data volumes, respectively, wherein the first data volume is a first primary volume, the second data volume is a second primary volume, and the first and second data volumes are unrelated data volumes; refreshing the second data volume to the data contents of the first data volume that existed at time T, wherein refreshing the second data volume further comprises overwriting data of the second data volume with data of the first data volume that existed at time T, generating first and second maps in memory, wherein each of the first and second maps comprises a plurality of entries, wherein
each entry of the first map corresponds to a respective memory block that stores data of the first data volume, and
each entry of the second map corresponds to a respective memory block that stores data of the second data volume,setting a first bit in each entry of the first map, wherein each first bit of the first map is set to indicate its respective memory block stores valid data, and clearing a first bit in each entry of the second map, wherein each first bit of the second map is set to indicate its respective memory block stores invalid data; modifying data of the first data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T; modifying data of the second data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T; and modifying data of the first data volume after the second data volume has been refreshed. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer readable medium storing instructions executable by a computer system, wherein the computer system implements a method in response to executing the instructions, the method comprising:
-
writing data to a first and a second data volume, wherein the first data volume is a first primary volume, the second data volume is a second primary volume, the first and second data volumes are unrelated data volumes; refreshing the second data volume to the data contents of the first data volume that existed at time T, wherein refreshing the second data volume further comprises overwriting data of the second data volume with data of the first data volume that existed at time T, generating first and second maps in memory, wherein each of the first and second maps comprises a plurality of entries, wherein
each entry of the first map corresponds to a respective memory block that stores data of the first data volume, and
each entry of the second map corresponds to a respective memory block that stores data of the second data volume,setting a first bit in each entry of the first map, wherein each first bit of the first map is set to indicate its respective memory block stores valid data, and clearing a first bit in each entry of the second maps wherein each first bit of the second map is set to indicate its respective memory block stores invalid data; modifying data of the first data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T; modifying data of the second data volume while the second data volume is being refreshed to the data contents of the first data volume that existed at time T; and modifying data of the first data volume after the second data volume has been refreshed. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17)
-
Specification