TWO-ALGORITHM SORT DURING BACKUP AND RECOVERY

• US 20150242284A1
• Filed: 02/25/2014
• Published: 08/27/2015
• Est. Priority Date: 02/25/2014
• Status: Abandoned Application

• Current Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Original Assignee: CA, Inc. (d/b/a CA Technologies) (Broadcom, Inc.)
• Inventors: Ignatius, Paul P.
• Application Number:
  US14/189,153
• Publication Number:
  US 20150242284A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1448 Management of the data involved in backup or backup restore
• CPC Class Codes: G06F 11/1451 by selection of backup contents
• CPC Class Codes: G06F 11/1469 Backup restoration techniques

Abstract

A backup of a file system is performed by scanning a file system to find elements that require a backup. Once at least one element is found, element identifiers associated with the elements are sorted using a first sorting algorithm to select an element for backup, and the element identifier associated with the selected element is appended to a backup list. A second sorting algorithm may also sort in parallel to the first sorting algorithm. The sorted elements are appended to the backup list until a predetermined rule is satisfied, when the remainder of the elements are sorted using a second sorting algorithm different from the first sorting algorithm. The element identifiers associated with the remaining elements are appended to the backup list in an order determined by the second sorting algorithm. While the sorting is occurring, the elements are backed up in the order of the backup list.

Claims

1. A method comprising:

identifying elements for backup, wherein the elements include element identifiers;

sorting, using a first sorting algorithm, element identifiers of elements identified for backup to select a sorted element and append the element identifier associated with the selected element to a backup list;

sorting, using a second sorting algorithm different from the first sorting algorithm, element identifiers not already selected by the first sorting algorithm for backup;

appending the element identifiers sorted by the second sorting algorithm to the backup list in an order determined by the second sorting algorithm; and

backing up the elements associated with the element identifiers in the backup list in the order in which the element identifiers are in the backup list, wherein the backing up occurs in parallel with a select one of;

the sorting using the second algorithm, and both the sorting using the second sorting algorithm and the sorting using the first sorting algorithm.

2. The method of claim 1, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is satisfied when the number of elements selected with the first algorithm is equal to one; and

the backing up occurs in parallel with the sorting performed with the second algorithm.

3. The method of claim 1, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is satisfied when the number of elements selected with the first algorithm is equal to a predetermined threshold greater than one; and

the backing up occurs in parallel with both the sorting performed using the second sorting algorithm and the sorting performed using the first sorting algorithm.

4. The method of claim 1, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is a determination as to whether an entire file system has been scanned to identify elements for backup; and

the backing up occurs in parallel with both the sorting performed using the second sorting algorithm and the sorting performed using the first sorting algorithm.

5. The method of claim 1, wherein:

sorting, using a first sorting algorithm, comprises sorting using a bubble-sort algorithm; and

sorting, using a second sorting algorithm different from the first sorting algorithm, comprises sorting using a quicksort algorithm.

6. The method of claim 1, wherein:

identifying elements for backup, wherein the elements include element identifiers comprises identifying elements for backup having element identifiers that are filenames of the elements; and

sorting, using a first sorting algorithm, further includes determining a lowest alphanumeric filename and selecting the element with the lowest alphanumeric filename.

7. The method of claim 1, wherein:

identifying elements for backup comprises scanning a file system to find elements for a backup using a depth-first scan; and

sorting, using a first sorting algorithm, comprises starting the first sorting algorithm after a first hierarchical level of the file system is scanned.

8. The method of claim 7, wherein sorting, using the first sorting algorithm, comprises starting the first sorting algorithm after a first hierarchical level of the file system is scanned and before a second hierarchical level of the file system is scanned.

9. The method of claim 1, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied; and

sorting, using a second sorting algorithm different from the first sorting algorithm comprises;

starting the second sorting algorithm before the predetermined rule is satisfied.

10. The method of claim 1 further including removing an element identifier from the backup list once the element associated with the element identifier is backed up.

11. A method comprising:

identifying elements for recovery, wherein the elements include element identifiers;

sorting, using a first sorting algorithm, element identifiers of elements identified for recovery to select a sorted element and append the element identifier associated with the selected element to a recovery list;

sorting, using a second sorting algorithm different from the first sorting algorithm, element identifiers not already selected by the first sorting algorithm;

appending the element identifiers sorted by the second sorting algorithm to the recovery list in an order determined by the second sorting algorithm; and

recovering the elements associated with the element identifiers in the recovery list in the order in which the element identifiers are in the recovery list, wherein the recovery occurs in parallel with a select one of;

the sorting using the second algorithm, and both the sorting using the second sorting algorithm and the sorting using the first sorting algorithm.

12. The method of claim 11, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is satisfied when the number of elements selected with the first algorithm is equal to one; and

the recovery occurs in parallel with the sorting performed with the second algorithm.

13. The method of claim 11, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is satisfied when the number of elements selected with the first algorithm is equal to a predetermined threshold greater than one; and

the recovery occurs in parallel with both the sorting performed using the second sorting algorithm and the sorting performed using the first sorting algorithm.

14. The method of claim 11, wherein:

identifying elements for recovery comprises;

merging backup catalogs to find elements for recovery;

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied, where the predetermined rule is a determination as to whether the backup catalogs have been merged entirely; and

the recovery occurs in parallel with both the sorting performed using the second sorting algorithm and the sorting performed using the first sorting algorithm.

15. The method of claim 11, wherein:

sorting, using a first sorting algorithm, comprises sorting using a bubble-sort algorithm; and

sorting, using a second sorting algorithm different from the first sorting algorithm, comprises sorting using a quicksort algorithm.

16. The method of claim 11, wherein:

identifying elements for recovery comprises;

identifying elements for recovery having element identifiers that are filenames of the elements; and

sorting, using a first sorting algorithm, further includes determining a lowest alphanumeric filename and selecting the element with the lowest alphanumeric filename.

17. The method of claim 11, wherein:

identifying elements for recovery comprises;

identifying elements for recovery having element identifiers that are timestamps of the elements; and

sorting, using a first sorting algorithm, the element identifiers to select an element for recovery further includes determining an oldest timestamp and selecting the element with the oldest timestamp.

18. The method of claim 11, wherein:

identifying elements for recovery comprises;

merging backup catalogs to find elements for recovery by creating a flattened list of all elements requested for recovery.

19. The method of claim 11, wherein:

sorting, using a first sorting algorithm comprises;

sorting, using the first sorting algorithm, until a predetermined rule is satisfied; and

sorting, using a second sorting algorithm different from the first sorting algorithm comprises;

starting the second sorting algorithm before the predetermined rule is satisfied.

20. The method of claim 11 further including:

removing an element identifier from the recovery list once the element associated with the element identifier is recovered.