IP Library › Granted Patent US 9,910,620

Granted Patent B1

US 9,910,620 · App. 15/086,577 · Granted Mar 6, 2018

Method and system for leveraging secondary storage for primary storage snapshots

Inventors: Alexandr Veprinsky (Brookline, MA); Assaf Natanzon (Tel Aviv, IL)

Assignee: EMC Corporation

G06F3/065 G06F3/0619 G06F3/0652 G06F3/0683

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 9,910,620
App. No.: 15/086,577
Granted: Mar 6, 2018
Kind: B1

External Links

USPTO Patent Center↗ Full Patent PDF↗

Abstract

Example embodiments of the present invention relate to a method, a system, and a computer program product for leveraging secondary storage for primary storage snapshots. The method includes creating a current first snapshot of a volume at a current first time in a primary storage. The method then may determine differences between the current first snapshot at the current first time and a previous second snapshot created at a previous second time. The differences then may be sent to a secondary storage.

Claims (72)

1. A method comprising:

creating a current first snapshot of a volume at a current first time in a primary storage;

determining differences between the current first snapshot at the current first time and a previous second snapshot created at a previous second time; and

sending the differences between the current first snapshot and the previous second snapshot to a secondary storage;

deleting data from addresses in the volume in the primary storage of the differences sent to the secondary storage;

storing pointers to the secondary storage for the deleted addresses in a low tier node in a hierarchy of nodes storing data for the volume at the primary storage;

receiving a read request, including a read address, at the primary storage; and

recursively attempting to read the data from the read address from an active or a higher level node in the hierarchy of nodes storing data for the volume at the primary storage comprises:

attempting to read the data from the read address at the active node in the hierarchy of nodes storing data for the volume at the primary storage; and

returning the data from the address if the data is stored at the address in the active node in the hierarchy of nodes storing data for the volume at the primary storage;

if the data is not stored at the address in the active node in the hierarchy of nodes storing data for the volume at the primary storage:

recursively attempting to read the data from the read address from the higher level node in the hierarchy of nodes storing data for the volume at the primary storage; and

returning the data from the address if the data is stored at the address in the hierarchy of nodes storing data for the volume at the primary storage;

wherein storing pointers to the secondary storage for the deleted addresses in a low tier node comprises storing a first type of metadata indicating that the data was tiered to the secondary storage; and

wherein recursively attempting to read the data from the read address from an active or a higher level node in the hierarchy of nodes comprises attempting to read from the higher level node in the hierarchy of nodes according to a second type of metadata indicating that read address in the active node is thin.

2. The method of claim 1 wherein deleting data from addresses in the volume in the primary storage of the differences sent to the secondary storage comprises determining data to delete from addresses in the volume in the primary storage according to a heatmap of read requests to the addresses.

3. The method of claim 1 further comprising:

receiving a write request, including data and a write address, at the primary storage;

storing data of the write request at the address in an active node of a hierarchy of nodes storing data for the volume at the primary storage.

4. The method of claim 1 further comprising:

receiving the differences between the current first snapshot and the previous second snapshot at the secondary storage; and

storing the differences in a third snapshot in the secondary storage.

5. A system comprising:

a primary storage;

a secondary storage; and

memory storing computer program code that when executed on a processor causes the processor to execute a replication process operable to perform the operations of:

creating a current first snapshot of a volume at a current first time in a primary storage;

determining differences between the current first snapshot at the current first time and a previous second snapshot created at a previous second time;

sending the differences between the current first snapshot and the previous second snapshot to a secondary storage;

deleting data from addresses in the volume in the primary storage of the differences sent to the secondary storage; and

storing pointers to the secondary storage for the deleted addresses in a low tier node in a hierarchy of nodes storing data for the volume at the primary storage;

receiving a read request, including a read address, at the primary storage;

recursively attempting to read the data from the read address from an active or a higher level node in the hierarchy of nodes storing data for the volume at the primary storage, the data from the read address from an active or a higher level node in the hierarchy of nodes storing data for the volume at the primary storage comprises computer program code operable to perform the operations of:

attempting to read the data from the read address at the active node in the hierarchy of nodes storing data for the volume at the primary storage; and

returning the data from the address if the data is stored at the address in the active node in the hierarchy of nodes storing data for the volume at the primary storage;

wherein the memory further stores computer program code operable to perform the operations of, if the data is not stored at the address in the hierarchy of nodes storing data for the volume at the primary storage:

recursively attempting to read the data from the read address from the higher level node in the hierarchy of nodes storing data for the volume at the primary storage; and

returning the data from the address if the data is stored at the address in the hierarchy of nodes storing data for the volume at the primary storage;

examining the read address in the low tier node in the hierarchy of nodes storing data for the volume at the primary storage for a pointer to the secondary storage; and

if there is a pointer for the read address in the low tier node in the hierarchy of nodes storing data for the volume at the primary storage, attempting to read the data from the read address at the secondary storage according to the pointer;

wherein computer program code operable to perform the operation of storing pointers to the secondary storage for the deleted addresses in a low tier node comprises computer program code operable to perform the operation of storing a first type of metadata indicating that the data was tiered to the secondary storage; and

wherein computer program code operable to perform the operation of recursively attempting to read the data from the read address from an active or a higher level node in the hierarchy of nodes comprises computer program code operable to perform the operation of attempting to read from the higher level node in the hierarchy of nodes according to a second type of metadata indicating that read address in the active node is thin.

6. The system of claim 5 wherein computer program code operable to perform the operation of deleting data from addresses in the volume in the primary storage of the differences sent to the secondary storage comprises computer program code operable to perform the operation of determining data to delete from addresses in the volume in the primary storage according to a heatmap of read requests to the addresses.

7. The system of claim 5 wherein the memory further stores computer program code operable to perform the operations of:

receiving a write request, including data and a write address, at the primary storage;

storing data of the write request at the address in an active node of a hierarchy of nodes storing data for the volume at the primary storage.

8. The system of claim 5 wherein the memory further stores computer program code operable to perform the operations of:

receiving the differences between the current first snapshot and the previous second snapshot at the secondary storage; and

storing the differences in a third snapshot in the secondary storage.

9. A computer program product including a non-transitory computer readable storage medium having computer program code encoded thereon that when executed on a processor of a computer causes the computer to execute a replication process comprising:

computer program code for creating a current first snapshot of a volume at a current first time in a primary storage;

computer program code for determining differences between the current first snapshot at the current first time and a previous second snapshot created at a previous second time;

computer program code for sending the differences between the current first snapshot and the previous second snapshot to a secondary storage;