Method and system for prioritizing critical data object storage during backup operations

Patent metadata

Field	Value
Publication number	US-11416159-B2
Application number	US-201916398206-A
Country	US
Kind code	B2
Filing date	Apr 29, 2019
Priority date	Apr 29, 2019
Publication date	Aug 16, 2022
Grant date	Aug 16, 2022

Abstract

A method and system for prioritizing critical data object storage during backup operations. Specifically, the method and system disclosed herein entail reordering data objects, awaiting being written to storage and thus queued in one or more data object queues, in accordance with a nearest-critical based sequential order. The nearest-critical based sequential order may be derived through modified weight-based Euclidean distances calculated between adjacent data object pairs queued in any given data object queue. Further, the calculated modified weight-based Euclidean distances incorporate data criticality factors associated with the adjacent data object pairs. By reordering data objects in a nearest-critical based sequential order, critical data objects may be written into storage first, thereby avoiding possible critical data loss should a disaster occur during backup operations.

First claim

What is claimed is:

1. A method for consolidating data objects, comprising:
identifying a first data object queue comprising a first set of data objects awaiting consolidation, wherein the first set of data objects is arranged according to a first queueing scheme, and wherein awaiting consolidation comprises awaiting route operations to a backup storage system;
mapping, respectively, the first set of data objects to a first set of data points in a coordinate space;
identifying a first set of data point pairs from the first set of data points;
identifying a set of priority weights for the first set of data objects based on a set of data criticality factors;
calculating a distance between each data point pair of the first set of data point pairs, to obtain a first set of distances, wherein a subset of a set of priority weights are used when calculating the distance between each data point pair, to obtain the first set of distances;
sorting the first set of data objects based at least on the first set of distances, wherein the first set of data objects become arranged according to a second queueing scheme; and
consolidating the first set of data objects in order of the second queueing scheme.

2. The method of claim 1 , wherein each data point pair, of the first set of data point pairs, map to a pair of adjacent data objects queued according to the first queueing scheme in the first data object queue.

3. The method of claim 1 , wherein the second queuing scheme prioritizes consolidation of critical data objects first.

4. The method of claim 1 , wherein the first set of data objects is one selected from a group consisting of a set of data blocks and a set of data files.

5. The method of claim 1 , wherein awaiting consolidation comprises awaiting write operations into a backup storage array.

6. The method of claim 5 , wherein the first set of data objects is a set of data packets.

7. The method of claim 1 , wherein the distance calculated between each data point pair is a modified weight-based Euclidean distance.

8. The method of claim 1 , further comprising:
prior to obtaining the first set of distances:
examining header information in each data object of the first set of data objects, to obtain the set of data criticality factors,
wherein the first set of data objects is one selected from a group consisting of a set of data packets and a set of data blocks.

9. The method of claim 1 , further comprising:
prior to obtaining the first set of distances:
performing a lookup on a priority assignment object using at least one selected from a group consisting of a file type and a filename associated with each data object of the first set of data objects, to obtain the set of data criticality factors,
wherein the first set of data objects is a set of data files.

10. The method of claim 1 , further comprising:
while concurrently processing the first set of data objects:
identifying a second data object queue comprising a second set of data objects awaiting consolidation, wherein the second set of data objects is arranged according to the first queueing scheme;
mapping, respectively, the second set of data objects to a second set of data points in the coordinate space;
identifying a second set of data point pairs from the second set of data points;
calculating the distance between each data point pair of the second set of data point pairs, to obtain a second set of distances;
sorting the second set of data objects based at least on the second set of distances, wherein the second set of data objects become arranged according to the second queueing scheme; and
consolidating the second set of data objects in order of the second queueing scheme.

11. A system, comprising:
a computer processor programmed to:
identify a data object queue comprising a set of data objects awaiting consolidation, wherein the set of data objects is arranged according to a first queueing scheme, and wherein awaiting consolidation comprises awaiting route operations to the backup storage system;
map, respectively, the set of data objects to a set of data points in a coordinate space;
identify a set of data point pairs from the set of data points;
identify a set of priority weights for the first set of data objects based on a set of data criticality factors;
calculate a distance between each data point pair of the set of data point pairs, to obtain a set of distances, wherein a subset of a set of priority weights are used when calculating the distance between each data point pair, to obtain the set of distances;
sort the set of data objects based at least on the set of distances, wherein the set of data objects become arranged according to a second queueing scheme; and
consolidate the set of data objects in order of the second queueing scheme.

12. The system of claim 11 , further comprising:
a backup storage system comprising the computer processor and a backup storage array,
wherein awaiting consolidation comprises awaiting write operations into the backup storage array.

13. The system of claim 12 , further comprising:
a plurality of source hosts operatively connected to the backup storage system,
wherein the set of data objects originate from at least one source host of the plurality of source hosts.

14. The system of claim 11 , further comprising:
a source host comprising the computer processor, and operatively connected to a backup storage system.

15. A non-transitory computer readable medium (CRM) comprising computer readable program code, which when executed by a computer processor, enable the computer processor to:
identify a data object queue comprising a set of data objects awaiting consolidation, wherein the set of data objects is arranged according to a first queueing scheme, and wherein awaiting consolidation comprises awaiting route operations to the backup storage system;
map, respectively, the set of data objects to a set of data points in a coordinate space;
identify a set of data point pairs from the set of data points;
identify, a set of priority weights for the first set of data objects based on a set of data criticality factors;
calculate a distance between each data point pair of the set of data point pairs, to obtain a set of distances, wherein a subset of a set of priority weights are used when calculating the distance between each data point pair, to obtain the set of distances;
sort the set of data objects based at least on the set of distances, wherein the set of data objects become arranged according to a second queueing scheme; and
consolidate the set of data objects in order of the second queueing scheme.

16. The non-transitory CRM of claim 15 , wherein each data point pair, of the set of data point pairs, map to a pair of adjacent data objects queued according to the first queueing scheme in the data object queue.

17. The non-transitory CRM of claim 15 , wherein the second queuing scheme prioritizes consolidation of critical data objects first.

18. The non-transitory CRM of claim 15 , wherein the distance calculated between each data point pair is a modified weight-based Euclidean distance.

19. The non-transitory CRM of claim 15 , wherein the set of data objects is one selected from a group consisting of a set of data packets, a set of data blocks, and a set of data files.

Assignees

• Emc Ip Holding Co Llc

Inventors

• Appireddygari Venkataramana Mahesh Reddy
• Battal Chetan M
• Shankar D H Swaroop
• Chopra Shelesh

Classifications

• G06F3/064

  Management of blocks · CPC title

• G06F3/065 Primary

  Replication mechanisms · CPC title

• G06F11/1458 Primary

  Management of the backup or restore process · CPC title

• G06F3/0673

  Single storage device · CPC title

• G06F11/1461 Primary

  Backup scheduling policy · CPC title