Volume restoration using an accumulator map

• US 7,743,227 B1
• Filed: 12/11/2007
• Issued: 06/22/2010
• Est. Priority Date: 12/20/2002
• Status: Expired due to Term

• Current Assignee: Veritas Technologies, LLC (Whitehouse Group Ltd.)
• Original Assignee: Symantec Operating Corporation (NortonLifeLock Inc.)
• Inventors: Kiselev, Oleg, Colgrove, John A.
• Primary Examiner(s): Peugh; Brian R
• Application Number:
  US12/001,486
• Time in Patent Office: 924 Days
• Field of Search: None
• US Class Current: 711/162
• CPC Class Codes: G06F 11/1469 Backup restoration techniques
• CPC Class Codes: G06F 16/9017 using directory or table look-up use of a directory or look-up table in file systems G06F16/13
• CPC Class Codes: G06F 2201/84 Using snapshots, i.e. a logical point-in-time copy of the data
• CPC Class Codes: Y10S 707/99953 Recoverability
• CPC Class Codes: Y10S 707/99955 Archiving or backup

Abstract

In a process to restore a data volume in a first memory, a virtual point-in-time (PIT) copy of the data volume is created. Creating the virtual PIT copy includes creating first, second and third maps in memory. Each of the first, second, and third maps includes a plurality of multi-bit entries. Each of the entries of the first and second maps corresponds to a respective memory region of the first memory, while each of the entries of the third map corresponds to a respective memory region of a second memory for storing data of the virtual PIT copy.

Claims

1. A method comprising:

creating a primary data volume in a first memory; and

creating a virtual point-in-time (PIT) copy of the primary data volume, wherein

the creating the virtual PIT copy comprises creating first, second and third maps in memory,

each of the first, second, and third maps comprises a plurality of multi-bit entries,

each of the entries of the first and second maps corresponds to a respective memory region of the first memory, and

each of the entries of the third map corresponds to a respective memory region of a second memory configured to store data of the virtual PIT copy.

2. The method of claim 1, wherein

each entry of the first, second, and third maps comprises first and second bits,

the first bit of each first map entry indicates whether its respective region of the first memory contains valid data of the primary data volume,

the second bit of each first map entry indicates whether its respective region of the first memory contains data that was modified since the creation of the first map,

the first bit of each third map entry indicates whether its respective region of the second memory contains valid data of the virtual PIT copy, and

the second bit of each third map entry indicates whether its respective region of the second memory contains data that was modified since the creation of the third map.

3. The method of claim 2, further comprising:

generating a first write-data transaction that, when completed, results in modification of first data of the primary data volume;

copying the first data from the first memory to the second memory before the first data is modified;

switching the state of one of the first bits of the third map in response to the copying the first data from the first memory to the second memory;

modifying the first data of the primary data volume; and

switching the state of one of the second bits of the first map in response to the generating the first write-data transaction.

4. The method of claim 3, further comprising:

creating a second virtual PIT copy of the primary data volume, wherein

the creating the second virtual PIT copy comprises creating a fourth map in memory, and

entries of the fourth map corresponds to respective memory regions of a third memory.

5. The method of claim 4, wherein

each entry of fourth map comprises first and second bits,

the first bit of each fourth map entry indicates whether its respective region of the third memory contains valid data of the second virtual PIT copy, and

the second bit of each fourth map entry indicates whether its respective region of the third memory contains data that was modified since the creation of the fourth map.

6. The method of claim 5, further comprising:

copying the contents of the first map into the third map; and

switching the state of a plurality of second bits of the first map after the contents of the first map is copied into the third map such that the state of all second bits of the first map are equal.

7. The method of claim 6, further comprising:

generating a second write-data transaction that, when completed, results in modification of second data of the primary data volume;

copying the second data from the first memory to the second and third memories before the second data is modified;

switching the state of one of the first bits of the fourth map in response to copying the second data from the first memory to the third memory;

switching the state of another of the first bits of the third map in response to copying the second data from the first memory to the second memory;

modifying the second data of the primary data volume; and

switching the state of another of the second bits of the first map in response to generating the first write-data transaction.

8. A computer program product, wherein said computer program product comprises a computer readable medium configured to store instructions executable by a computer system, and the computer system implements a method in response to executing the instructions, the method comprising:

creating a primary data volume in a first memory; and

creating a virtual point-in-time (PIT) copy of the primary data volume, wherein

the creating the virtual PIT copy comprises creating first, second and third maps in a memory of the computer system,

each of the first, second, and third maps comprises a plurality of multi-bit entries,

each of the entries of the first and second maps corresponds to a respective memory region of the first memory, and

each of the entries of the third map corresponds to a respective memory region of a second memory configured to store data of the virtual PIT copy.

9. The computer program product of claim 8, wherein

each entry of the first, second, and third maps comprises first and second bits,

the first bit of each first map entry indicates whether its respective region of the first memory contains valid data of the primary data volume,

the second bit of each first map entry indicates whether its respective region of the first memory contains data that was modified since the creation of the first map,

the first bit of each third map entry indicates whether its respective region of the second memory contains valid data of the virtual PIT copy, and

the second bit of each third map entry indicates whether its respective region of the second memory contains data that was modified since the creation of the third map.

10. The computer program product of claim 9, wherein the method further comprises:

generating a first write-data transaction that, when completed, results in modification of first data of the primary data volume;

copying the first data from the first memory to the second memory before the first data is modified;

switching the state of one of the first bits of the third map in response to the copying the first data from the first memory to the second memory;

modifying the first data of the primary data volume; and

switching the state of one of the second bits of the first map in response to the generating the first write-data transaction.

11. The computer program product of claim 10, wherein the method further comprises:

creating a second virtual PIT copy of the primary data volume, wherein creating the second virtual PIT copy comprises creating a fourth map in memory, wherein

entries of the fourth map corresponds to respective memory regions of a third memory.

12. The computer program product of claim 11, wherein

each entry of fourth map comprises first and second bits,

the first bit of each fourth map entry indicates whether its respective region of the third memory contains valid data of the second virtual PIT copy, and

the second bit of each fourth map entry indicates whether its respective region of the third memory contains data that was modified since the creation of the fourth map.

13. The computer readable medium of claim 12, wherein the method further comprises:

copying the contents of the first map into the third map.

14. The computer program product of claim 13, wherein the method further comprises:

switching the state of a plurality of second bits of the first map after the contents of the first map is copied into the third map so that the state of all second bits of the first map are equal.

15. The computer program product of claim 14, wherein the method further comprises:

generating a second write-data transaction that, when completed, results in modification of second data of the primary data volume;

copying the second data from the first memory to the second and third memories before the second data is modified;

switching the state of one of the first bits of the fourth map in response to copying the second data from the first memory to the third memory;

switching the state of another of the first bits of the third map in response to the copying the second data from the first memory to the second memory;

modifying the second data of the primary data volume;

switching the state of another of the second bits of the first map in response to the generating the first write-data transaction.

16. An apparatus comprising:

a first memory, wherein the first memory is configured to store a primary data volume;

a second memory, wherein the second memory is configured to store a virtual point-in-time (PIT) copy of the primary data volume; and

a computer system, wherein

the computer system is communicatively coupled to the first and the second memories,

the computer system comprises

a memory,

means for creating a primary data volume in the first memory,

means for creating first, second and third maps in the memory, and

means for creating a virtual point-in-time (PIT) copy of the primary data volume,

each of the first, the second, and the third maps comprises a plurality of multi-bit entries,

each of the entries of the first and the second maps corresponds to a respective memory region of the first memory, and

each of the entries of the third map corresponds to a respective memory region of the second memory.

17. The apparatus of claim 16, wherein

each entry of the first, second, and third maps comprises first and second bits,

the first bit of each first map entry indicates whether its respective region of the first memory contains valid data of the primary data volume,

the second bit of each first map entry indicates whether its respective region of the first memory contains data that was modified since the creation of the first map,

the first bit of each third map entry indicates whether its respective region of the second memory contains valid data of the virtual PIT copy, and

the second bit of each third map entry indicates whether its respective region of the second memory contains data that was modified since the creation of the third map.

18. The apparatus of claim 17, wherein the computer system further comprises:

means for generating a first write-data transaction that, when completed, results in modification of first data of the primary data volume;

means for copying the first data from the first memory to the second memory before the first data is modified;

means for switching the state of one of the first bits of the third map in response to the means for copying the first data from the first memory to the second memory;

means for modifying the first data of the primary data volume; and

means for switching the state of one of the second bits of the first map in response to the means for generating the first write-data transaction.

19. The apparatus of claim 18, wherein the computer system further comprises:

means for creating a second virtual PIT copy of the primary data volume, wherein

the means for creating the second virtual PIT copy comprises means for creating a fourth map in the memory; and

entries of the fourth map corresponds to respective memory regions of a third memory.

20. The apparatus of claim 19, wherein

each entry of fourth map comprises first and second bits,

the first bit of each fourth map entry indicates whether its respective region of the third memory contains valid data of the second virtual PIT copy, and

the second bit of each fourth map entry indicates whether its respective region of the third memory contains data that was modified since the creation of the fourth map.