Method and system for concurrently backing up data streams based on backup time estimates

• US 9,864,760 B1
• Filed: 12/05/2013
• Issued: 01/09/2018
• Est. Priority Date: 12/05/2013
• Status: Active Grant

• Current Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Original Assignee: Emc IP Holding Company LLC (Dell Technologies Inc.)
• Inventors: Gupta, Rajendra Kumar, Mandic, Vladimir, Sharma, Anupam
• Primary Examiner(s): Coby, Frantz
• Application Number:
  US14/097,759
• Time in Patent Office: 1,496 Days
• Field of Search: 707652, 707823, 707654, 707634, 707640, 707645, 709203, 711162
• CPC Class Codes: G06F 11/1461 Backup scheduling policy
• CPC Class Codes: G06F 11/1464 for networked environments
• CPC Class Codes: G06F 16/1844 Management specifically adapted to replicated file systems
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/27 Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
• CPC Class Codes: G06F 2201/80 Database-specific techniques

Abstract

Concurrently backing up data streams based on backup time estimates is described. A system identifies multiple data streams scheduled for backup. The system identifies multiple backup time estimates corresponding to the multiple data streams. The system creates a ranked relational sequence based on the multiple backup time estimates. The system concurrently backs up the multiple data streams based on a concurrency limit and the ranked relational sequence.

Claims

1. A system for concurrently backing up data streams based on backup time duration estimates, the system comprising:

a processor-based application executed on a computer and configured to;

identify a plurality of data streams scheduled for backup, each data stream corresponding to a different database, each data stream being received over a network;

determine backup time duration estimates corresponding to each of the plurality of data streams, the backup time duration estimates being based on corresponding normalized historical backup time durations of the plurality of data streams, data transfer rates associated with each of the plurality of data streams, and the size of each of the plurality of data streams;

create a ranked relational sequence based on the plurality of backup time duration estimates; and

concurrently back up the plurality of data streams based on a concurrency limit and the ranked relational sequence.

2. The system of claim 1, wherein at least some of the plurality of backup time duration estimates are based on corresponding sizes of the plurality of data streams.

3. The system of claim 2, wherein the corresponding sizes of the plurality of data streams are identified by executing an application program interface associated with an operating system.

4. The system of claim 1, wherein the corresponding historical backup time duration estimates of the plurality of data streams are normalized based on corresponding historical sizes of the plurality of data streams relative to corresponding current sizes of the plurality of data streams.

5. The system of claim 1, wherein the ranked relational sequence is based on a decreasing order from a longest time estimate to a shortest time estimate.

6. The system of claim 1, wherein the ranked relational sequence is based on an increasing order from a shortest time estimate to a longest time estimate.

7. A computer-implemented method for concurrently backing up data streams based on backup time duration estimates, the method comprising:

insert a processor circuitry configured for

identifying a plurality of data streams scheduled for backup, each data stream corresponding to a different database, each data stream being received over a network;

determining backup time duration estimates corresponding to each of the plurality of data streams, the backup time duration estimates being based on corresponding normalized historical backup time durations of the plurality of data streams, data transfer rates associated with each of the plurality of data streams, and the size of each of the plurality of data streams;

creating a ranked relational sequence based on the plurality of backup time duration estimates; and

concurrently backing up the plurality of data streams based on a concurrency limit and the ranked relational sequence.

8. The method of claim 7, wherein at least some of the plurality of backup time duration estimates are based on corresponding sizes of the plurality of data streams.

9. The method of claim 8, wherein the corresponding sizes of the plurality of data streams are identified by executing an application program interface associated with an operating system.

10. The method of claim 7, wherein the corresponding historical backup time duration estimates of the plurality of data streams are normalized based on corresponding historical sizes of the plurality of data streams relative to corresponding current sizes of the plurality of data streams.

11. The method of claim 7, wherein the ranked relational sequence is based on a decreasing order from a longest time estimate to a shortest time estimate.

12. The method of claim 7, wherein the ranked relational sequence is based on an increasing order from a shortest time estimate to a longest time estimate.

13. A computer program product, comprising a non-transitory computer-readable medium having a computer-readable program code embodied therein to be executed by one or more processor circuitries, the program code including instructions to:

identify a plurality of data streams scheduled for backup, each data stream corresponding to a different database, each data stream being received over a network;

backup time duration estimates corresponding to each of the plurality of data streams, the backup time duration estimates being based on corresponding normalized historical backup time durations of the plurality of data streams, data transfer rates associated with each of the plurality of data streams, and the size of each of the plurality of data streams;

create a ranked relational sequence based on the plurality of backup time duration estimates; and

concurrently back up the plurality of data streams based on a concurrency limit and the ranked relational sequence.

14. The computer program product of claim 13, wherein at least some of the plurality of backup time duration estimates are based on corresponding sizes of the plurality of data streams.

15. The computer program product of claim 14, wherein the corresponding sizes of the plurality of data streams are identified by executing an application program interface associated with an operating system.

16. The computer program product of claim 13, wherein the corresponding historical backup time duration estimates of the plurality of data streams are normalized based on corresponding historical sizes of the plurality of data streams relative to corresponding current sizes of the plurality of data streams.

17. The computer program product of claim 13, wherein the ranked relational sequence is based on one of a decreasing order from a longest time estimate to a shortest time estimate and an increasing order from a shortest time estimate to a longest time estimate.