System and method for journal recovery for multinode environments
View Patent ↗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.
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.