Optimization for transaction failover in a multi-node system environment where objects' mastership is based on access patterns

• US 7,454,422 B2
• Filed: 11/18/2005
• Issued: 11/18/2008
• 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 Wai Shun, Zoll, Michael, Pruscino, Angelo, Roesch, Stefan
• Primary Examiner(s): Lu; Kuen S
• Application Number:
  US11/282,327
• Publication Number:
  US 20070043728A1
• Time in Patent Office: 1,096 Days
• Field of Search: 709/9, 709/10, 709/101, 709/204
• 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 executing one or more transactions by selecting another node to complete the transactions, and assigning to the selected node the affinity relationships that existed between the terminated node and the objects being accessed by said transactions.

Claims

1. A method for transaction failover in a multi-node system, the method comprising:

causing one or more nodes to execute one or more transactions, said one or more transactions including a certain transaction having been executed on a node that terminated prior to completing said certain transaction;

tracking an affinity relationship between affinity objects and said certain transaction;

transferring said certain transaction to another node;

establishing said another node as master of said affinity objects; and

remastering said affinity objects by transferring affinity relationships to said another node.

2. The method of claim 1 wherein establishing said another node as master of said affinity objects is based on said tracking an affinity relationship between affinity objects and said certain transaction.

3. The method of claim 1 further comprising dissolving affinity relationships when said certain transaction is done.

4. The method of claim 1, wherein said multi-node system is a database system.

5. The method of claim 1 further comprising dissolving said affinity relationship in response to said another node completing execution of said certain transaction that had been executed on the terminated node.

6. The method of claim 1 further comprising maintaining said affinity relationship in said another node completing execution of said certain transaction that had been executed on said terminated node.

7. The method of claim 1 wherein:

at the time of termination, the terminated node was executing one or more transactions that were not accessing any of said affinity objects; and

in response to termination of the terminated node, resources mastered by said terminated node 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 1 further comprising selecting a particular node to be a failover node for the terminated node based on one or more characteristics of the particular node.

11. The method of claim 1 further comprising randomly selecting a particular node to be a failover node for the terminated node.

12. The method of claim 1 wherein the execution of said certain transaction on said terminated node operates to create affinity between said terminated node and said affinity objects being accessed by said certain transaction where no affinity had existed prior to beginning the execution of said certain transaction.

13. A computer-readable storage medium storing 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.

14. A computer-readable storage medium storing 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.

15. A computer-readable storage medium storing 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.

16. A computer-readable storage medium storing 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.

17. A computer-readable storage medium storing 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.

18. A computer-readable storage medium storing 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.

19. A computer-readable storage medium storing 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.

20. A computer-readable storage medium storing 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.

21. A computer-readable storage medium storing 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.

22. A computer-readable storage medium storing 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.

23. A computer-readable storage medium storing 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.

24. A computer-readable storage medium storing 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 12.

25. A method for transaction failover in a multi-node system, the method comprising:

causing one or more nodes to execute one or more transactions, said one or more transactions including a certain transaction having been executed on a node that terminated prior to completing said certain transaction;

associating affinity objects with said certain transaction;

creating an affinity relationship between said terminated node and said affinity objects; and

transferring said affinity relationship for said affinity objects of said certain transaction to a failover node;

wherein said transferring causes remastering.

26. The method of claim 25 further comprising associating a tracking of objects accessed by said transaction.

27. The method of claim 25 further comprising dissolving affinity relationships when said certain transaction is done.

28. The method of claim 25, wherein said multi-node system is a database system.

29. A computer-readable storage medium storing 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 25.

30. A computer-readable storage medium storing 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 26.

31. A computer-readable storage medium storing 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 27.

32. A computer-readable storage medium storing 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 28.