Replication of content-based storage using address space slices

Patent metadata

Field	Value
Publication number	US-10409520-B1
Application number	US-201715499226-A
Country	US
Kind code	B1
Filing date	Apr 27, 2017
Priority date	Apr 27, 2017
Publication date	Sep 10, 2019
Grant date	Sep 10, 2019

Abstract

A computer program product, system, and method for determining one or more slices of a logical address space assigned to replication processor; determining an elapsed time since a start of a replication cycle; determining an expected number of slices that should have been replicated based on the elapsed time; and replicating one or more slices of the logical address space in response to determining the expected number of slices that should have been replicated is less than an actual number of slices replicated by the replication processor within the replication cycle.

First claim

What is claimed is:

1. A method comprising:
determining one or more slices of a logical address space assigned to a replication processor;
determining an elapsed time since a start of a replication cycle;
determining an expected number of slices that should have been replicated based on the elapsed time; and
replicating one or more slices of the logical address space in response to determining the expected number of slices that should have been replicated is more than an actual number of slices replicated by the replication processor within the replication cycle.

2. The method of claim 1 wherein determining an expected number of slices that should have been replicated is further based on a recovery point objective (RPO) and a number of slices of the logical address space assigned to the replication processor.

3. The method of claim 1 wherein determining an expected number of slices that should have been replicated is further based upon an acceleration factor.

4. The method of claim 1 further comprising assigning each slice of a logical address space to one of a plurality of replication processors.

5. A system comprising:
a processor;
a volatile memory; and
a non-volatile memory storing computer program code that when executed on the processor causes the processor to execute a process operable to:
determine one or more slices of a logical address space assigned to a replication processor;
determine an elapsed time since a start of a replication cycle;
determine an expected number of slices that should have been replicated based on the elapsed time; and
replicate one or more slices of the logical address space in response to determining the expected number of slices that should have been replicated is more than an actual number of slices replicated by the replication processor within the replication cycle.

6. The system of claim 5 wherein determining an expected number of slices that should have been replicated is further based on a recovery point objective (RPO) and a number of slices of the logical address space assigned to the replication processor.

7. The system of claim 5 wherein determining an expected number of slices that should have been replicated is further based upon an acceleration factor.

8. The system of claim 5 wherein the process is further operable to assign each slice of a logical address space to one of a plurality of replication processors.

9. A computer program product tangibly embodied in a non-transitory computer-readable medium, the computer-readable medium storing program instructions that are executable to:
determine one or more slices of a logical address space assigned to a replication processor;
determine an elapsed time since a start of a replication cycle;
determine an expected number of slices that should have been replicated based on the elapsed time; and
replicate one or more slices of the logical address space in response to determining the expected number of slices that should have been replicated is more than an actual number of slices replicated by the replication processor within the replication cycle.

10. The computer program product of claim 9 wherein determining an expected number of slices that should have been replicated is further based on a recovery point objective (RPO) and a number of slices of the logical address space assigned to the replication processor.

11. The computer program product of claim 9 wherein determining an expected number of slices that should have been replicated is further based upon an acceleration factor.

12. The computer program product of claim 9 wherein the instructions are further executable to assign each slice of a logical address space to one of a plurality of replication processors.

Assignees

• Emc Ip Holding Co Llc

Inventors

• Meiri David
• Stronge William

Classifications

• G06F3/065 Primary

  Replication mechanisms · CPC title

• G06F3/0689 Primary

  Disk arrays, e.g. RAID, JBOD · CPC title

• G06F3/061

  Improving I/O performance · CPC title

• G06F3/0619

  in relation to data integrity, e.g. data losses, bit errors · CPC title

• G06F3/067

  Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title