Reestablishing process context

• US 20080065663A1
• Filed: 04/14/2005
• Published: 03/13/2008
• Est. Priority Date: 04/14/2005
• Status: Abandoned Application

• Current Assignee: EMC Corporation (Dell Technologies Inc.)
• Original Assignee: EMC Corporation (Dell Technologies Inc.)
• Inventors: Reitmeyer, Richard, Maruyama, William, Farlee, Kevin
• Application Number:
  US11/107,991
• Publication Number:
  US 20080065663A1
• Time in Patent Office: Days
• US Class Current: 707/101
• CPC Class Codes: G06F 11/1458 Management of the backup or restore process
• CPC Class Codes: G06F 11/1466 to make the backup process non-disruptive
• CPC Class Codes: G06F 11/1471 involving logging of persistent data for recovery

Abstract

Resuming processing of a hierarchical data is disclosed. A previously-processed part of the hierarchical data is traversed by starting at a first level of the hierarchical data, omitting at least one processing operation with respect to data in the previously-processed part. Sub-levels, if any, are descended only if they lead to a restart location within the hierarchical data. Normal processing is resumed starting from a next data after the restart location.

Claims

1. A method of resuming processing of a hierarchical data, comprising:

traversing a previously-processed part of the hierarchical data by starting at a first level of the hierarchical data, omitting at least one processing operation with respect to data in the previously-processed part;

descending only into sub-levels, if any, that lead to a restart location within the hierarchical data; and

resuming normal processing of a remaining part of the hierarchical data starting from a next data after the restart location, wherein resuming normal processing includes processing the remaining part in the same order as the previous processing would have processed the remaining part had the previous processing not been interrupted.

2. A method as recited in claim 1, wherein the processing comprises backup of a file system.

3. A method as recited in claim 1, wherein traversing comprises accessing file system directory information.

4. A method as recited in claim 1, wherein the previously-processed part comprises file system entries completely backed up before an interruption of a backup process.

5. A method as recited in claim 1, wherein the first level comprises a general level of the hierarchical data.

6. A method as recited in claim 1, wherein the hierarchical data comprises a file system or portion thereof and the first level comprises a root directory.

7. A method as recited in claim 1, wherein the processing operation comprises one or more of the following:

building a traverse list, building a recursive stack, backing up data, reading a file system entry, reading contents of a directory, traversing a directory, and initializing one or more variables and data structures.

8. A method as recited in claim 1, wherein descending comprises making a recursive function call.

9. A method as recited in claim 1, wherein descending comprises one or more of the following:

building a traverse list, building a recursive stack, reading a file system entry, reading contents of a directory, traversing a directory, and initializing one or more variables and data structures.

10. A method as recited in claim 1, wherein each sub-level, if any, comprises a directory on a same or different level as a first level directory associated with the first level.

11. A method as recited in claim 1, wherein the restart location comprises a file system entry.

12. A method as recited in claim 1, wherein resuming normal processing includes stopping the resumed processing and restarting processing at the first level if the restart location is determined to be invalid.

13. A method as recited in claim 1, wherein the normal processing comprises backup processing.

14. A method as recited in claim 1, wherein the next data comprises a next entry in a traverse list that occurs in the traverse list at a point immediately after an entry associated with the restart location.

15. A method as recited in claim 1, wherein said traversing and descending are accomplished without recursion.

16. A method as recited in claim 1, wherein the restart location is determined by a process, comprising:

determining a segment ending offset relative to a reference point of a last segment of data associated with a hierarchical data set, which last segment was the last data associated with the hierarchical data set to be saved on a storage media; and

determining a location within the hierarchical data set of a data object that was the last data object saved completely to the storage media by comparing a data object ending offset relative to the reference point with the segment ending offset.

17. A method as recited in claim 1, wherein normal processing comprises:

receiving a first list of items in a first level of the data;

sorting the first list in an order;

processing the data of the first level in the order of the sorted first list; and

if another level of data is encountered during processing;

receiving a second list of items in the encountered level;

sorting the second list in an order; and

processing the data in the order of the second list.

18. A method as recited in claim 1, wherein the normal processing includes traversing the hierarchical data in a repeatable manner and further comprising identifying the restart location.

19. A system for resuming processing of a hierarchical data, comprising:

a processor configured to;

traverse a previously-processed part of the hierarchical data by starting at a first level of the hierarchical data, omitting at least one processing operation with respect to data in the previously-processed part, descend only into sub-levels, if any, that lead to a restart location within the hierarchical data, and resume normal processing of a remaining part of the hierarchical data starting from a next data after the restart location, wherein resuming normal processing includes processing the remaining part in the same order as the previous processing would have processed the remaining part had the previous processing not been interrupted; and

a memory coupled to the processor and configured to provide instructions to the processor.

20. A system as recited in claim 19, wherein the processing comprises backup of a file system.

21. A system as recited in claim 19, wherein the previously-processed part comprises file system entries completely backed up before an interruption of a backup process.

22. A system as recited in claim 19, wherein each sub-level, if any, comprises a directory on a same or different level as a first level directory associated with the first level.

23. A computer program product for resuming processing of a hierarchical data, the computer program product being embodied in a computer readable medium and comprising computer instructions for:

traversing a previously-processed part of the hierarchical data by starting at a first level of the hierarchical data, omitting at least one processing operation with respect to data in the previously-processed part;

descending only into sub-levels, if any, that lead to a restart location within the hierarchical data; and

resuming normal processing of a remaining part of the hierarchical data starting from a next data after the restart location, wherein resuming normal processing includes processing the remaining part in the same order as the previous processing would have processed the remaining part had the previous processing not been interrupted.

24. A computer program product as recited in claim 23, wherein the processing comprises backup of a file system.

25. A computer program product as recited in claim 23, wherein the previously-processed part comprises file system entries completely backed up before an interruption of a backup process.

26. A computer program product as recited in claim 23, wherein each sub-level, if any, comprises a directory on a same or different level as a first level directory associated with the first level.