Affinity-based recovery/failover in a cluster environment

• US 20070043726A1
• Filed: 08/16/2005
• Published: 02/22/2007
• Est. Priority Date: 08/16/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Yurek, Tolga, Chan, Wilson, Zoll, Michael, Pruscino, Angelo, Roesch, Stefan
• Granted Patent: US 7,814,065 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 11/203 using migration
• CPC Class Codes: G06F 11/2033 switching over of hardware resources
• CPC Class Codes: G06F 11/2035 without idle spare hardware
• CPC Class Codes: G06F 11/2046 where the redundant components share persistent storage G06F11/2043 takes precedence
• CPC Class Codes: G06F 11/30 Monitoring
• CPC Class Codes: G06F 2201/825 the problem or solution involving locking
• CPC Class Codes: Y10S 707/99939 Privileged access
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

Techniques are provided for responding to the termination of a node by selecting another node, and assigning to the selected node the affinity relationships that existed between the terminated node and one or more objects. The resources that belong to the objects involved in the affinity relationships are remastered to the selected node. The selected node then performs recovery of the resources that had been opened by the terminated node and/or serves as a failover node to execute the transactions that had been executing on the terminated node.

Claims

1. A method for responding to termination of a terminated node, the method comprising:

causing a particular node to master all resources that belong to a particular object by transferring to the particular node an affinity relationship that was between the particular object and the terminated node;

causing the particular node to perform at least one of;

recovering resources that were opened by the terminated node; and

serving as a failover node to execute one or more transactions that had been executing on the terminated node.

2. The method of claim 1 wherein the step of causing the particular node to perform includes causing the particular node to perform both of:

recovering resources that were opened by the terminated node; and

serving as a failover node to execute one or more transactions that had been executing on the terminated node.

3. The method of claim 1 wherein the step of causing the particular node to perform includes causing the particular node to recover resources that were opened by the terminated node.

4. The method of claim 1 wherein the step of causing the particular node to perform includes causing the particular node to serve as a failover node to execute one or more transactions that had been executing on the terminated node.

5. The method of claim 3 further comprising dissolving said affinity relationship in response to the particular node completing the recovery of resources that were opened by the terminated node.

6. The method of claim 4 further comprising dissolving said affinity relationship in response to the particular node completing execution of the one or more transactions that had been executing on the terminated node.

7. The method of claim 1 wherein:

at the time of termination, the terminated node was master of a set of resources that did not belong to the particular object;

in response to termination of the terminated node, resources within said set of resources are randomly remastered among a plurality of remaining nodes.

8. The method of claim 1 wherein termination of the terminated node is an unplanned termination caused by a failure.

9. The method of claim 1 wherein termination of the terminated node is a planned termination.

10. The method of claim 3 further comprising selecting the particular node to be the recovery node for the terminated node based on one or more characteristics of the particular node.

11. The method of claim 4 further comprising selecting the particular node to be the failover node for the terminated node based on one or more characteristics of the particular node.

12. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1.

13. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2.

14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3.

15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4.

16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5.

17. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6.

18. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7.

19. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8.

20. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 9.

21. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10.

22. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 11.