System and method for journal recovery for multinode environments

• US 7,111,197 B2
• Filed: 09/20/2002
• Issued: 09/19/2006
• Est. Priority Date: 09/21/2001
• Status: Active Grant

• Current Assignee: Valtrus Innovations Limited (f/k/a Dolya Holdco 9 Limited) (Key Patent Innovations Limited)
• Original Assignee: PolyServe, Inc. (HP Inc.)
• Inventors: Kingsbury, Brent A., Revitch, Sam, Rokop, Terence M.
• Primary Examiner(s): Baderman, Scott
• Assistant Examiner(s): GENTRY, DAVID G
• Application Number:
  US10/251,626
• Publication Number:
  US 20050015640A1
• Time in Patent Office: 1,460 Days
• Field of Search: 714/15, 714/19, 707/202
• US Class Current: 714/19
• CPC Class Codes: G06F 11/0709 in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
• CPC Class Codes: G06F 11/0793 Remedial or corrective actions recovery from an exception in an instruction pipeline G06F9/3861; by retry G06F11/1402; for recovering from a failure of a protocol instance or entity H04L69/40
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

A system and method are disclosed for providing journal recovery in a multi-node environment which comprises determining whether a block was last updated by a first node; determining whether the block is associated with a lock held by a second node; and writing the block to a final location if the block is not associated with a lock held by the second node. In another embodiment, a system and method are disclosed for providing journal recovery in a multi-node environment which comprises determining whether a block is associated with metadata; determining whether the block is associated with a lock held by a surviving node; and writing the block to a final location if the block is not associated with a lock held by the surviving node.

Claims

1. A method of journal recovery in a multi-node environment comprising:

determining whether a block was last updated by a first node;

determining whether the block is associated with a lock held by a second node;

writing the block to a final location if the block was last updated by the first node and is not associated with a lock held by the second node; and

not writing the block to the final location if the block was last updated by the first node but is associated with a lock held by the second node.

2. The method of claim 1, wherein the first node is a failed node.

3. The method of claim 1, wherein the second node is a surviving node.

4. The method of claim 1, further comprising determining whether a journal entry was created by the first node.

5. A system of journal recovery in a multi-node environment comprising:

a processor configured to determine whether a block was last updated by a first node;

determine whether the block is associated with a lock held by a second node;

write the block to a final location if the block was last updated by the first node and is not associated with a lock held by the second node; and

not write the block to the final location if the block was last updated by the first node but is associated with a lock held by the second node; and

a memory coupled to the processor, wherein the memory provides the processor with instructions.

6. A system of journal recovery in a multi-node environment comprising:

a first node, wherein the first node has failed;

a second node;

a third node configured to determine whether a block was last updated by the first node;

determine whether the block is associated with a lock held by the second node;

write the block to a final location if the block was last updated by the first node and is not associated with a lock held by the second node; and

not write the block to the final location if the block was last updated by the first node but is associated with a lock held by the second node.

7. The system of claim 6, wherein the second node and the third node are the same node.

8. The system of claim 6, wherein the second node and the third node are different nodes.

9. The system of claim 6, wherein the second node is a surviving node.

10. A method of journal recovery in a multi-node environment comprising:

determining whether a block is associated with metadata;

determining whether the block is associated with a lock held by a surviving node;

writing the block to a final location if the block was associated with the metadata and is not associated with a lock held by the surviving node; and

not writing the block to the final location if the block was associated with the metadata but is associated with a lock held by the second node.

11. The method of claim 10, wherein the writing the block to a final location occurs if the block is not associated with a lock held by the surviving node, and the block is associated with metadata.

12. A system of journal recovery in a multi-node environment comprising:

a first node, wherein the first node has failed;

a second node;

a third node configured to determine whether a block is associated with metadata;

determine whether the block is associated with a lock held by the second node;

write the block to a final location if the block was associated with the metadata and is not associated with a lock held by the second node; and

not write the block to the final location if the block was associated with the metadata but is associated with a lock held by the second node.

13. The system of claim 12, wherein the second node and the third node are the same node.

14. The system of claim 12, wherein the second node and the third node are different nodes.

15. The system of claim 12, wherein the second node is a surviving node.

16. A computer program product for journal recovery in a multi-node environment, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for:

determining whether a block was last updated by a first node;

determining whether the block is associated with a lock held by a second node;

writing the block to a final location if the block was last updated by the first node and is not associated with a lock held by the second node; and

not writing the block to the final location if the block was last updated by the first node but is associated with a lock held by the second node.

17. A computer program product for journal recovery in a multi-node environment, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for:

determining whether a block is associated with metadata;

determining whether the block is associated with a lock held by a surviving node;

writing the block to a final location if the block was associated with the metadata and is not associated with a lock held by the surviving node; and

not writing the block to the final location if the block was associated with the metadata but is associated with a lock held by the surviving node.