Determining affinity in a cluster

• US 20060265420A1
• Filed: 05/18/2005
• Published: 11/23/2006
• Est. Priority Date: 05/18/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Chandrasekaran, Sashikanth, Macnaughton, Neil James Scott
• Granted Patent: US 8,037,169 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2343 Locking methods, e.g. distributed locking or locking implementation details

Abstract

A lock manager system is provided that includes multiple distinct mechanisms for assigning resources to masters. Specifically, the lock manager system includes (1) one or more assignment mechanisms that do not take into account the affinity between nodes and objects (“affinity-independent assignment mechanisms”), and (3) one or more assignment mechanisms that do take into account the affinity between nodes and objects (“affinity-based assignment mechanisms”). At any given time, the assignment of any given resource to a master is governed by only one of the multiple assignment mechanisms employed by the system. Various techniques are described for determining which assignment mechanism to use with which resources.

Claims

1. A method for communicating affinity information in a system that includes a plurality of nodes, comprising:

causing each node of the plurality of nodes to maintain a set of affinity information by performing the steps of

storing, within the set of affinity information, affinity information relating to the node'"'"'s own use of each object of a plurality of objects;

when the node sends a particular type of message to another node, piggy-backing on the message affinity information relating to the node'"'"'s use of a particular object; and

when the node receives a particular type of message from another node, reading from the message piggy-backed affinity information relating to the other node'"'"'s use of a particular object, and updating the set of affinity information based on the affinity information that was piggy-backed on the message from the other node.

2. The method of claim 1 wherein:

the step of piggy-backing on the message affinity information relating to the node'"'"'s use of a particular object includes;

when the node sends a lock request for a resource that belongs to a particular object, including in the lock request affinity information relating to the node'"'"'s use of the particular object;

the step of reading from the message piggy-backed affinity information relating to the other node'"'"'s use of a particular object includes;

when the node receives a lock request, from another node, for a resource that belongs to a particular object, reading from the lock request affinity information relating to the other node'"'"'s use of the particular object, and updating the set of affinity information based on the affinity information read from the received lock request.

3. The method of claim 1 wherein the set of affinity information maintained by each node includes information about how many locks other nodes within the system have opened on each object of the plurality of objects.

4. The method of claim 1 further comprising each node determining, based on the set of affinity information maintained by the node, whether affinity start conditions have been satisfied between the node and any of the plurality of objects.

5. The method of claim 4 further comprising, in response to a node determining that affinity start conditions have been satisfied between the node and a particular object, establishing an affinity relationship between the node and the particular object.

6. The method of claim 5 further comprising, in response to establishing an affinity relationship between the node and the particular object, remastering at the node all resources that belong to the object.

7. The method of claim 1 further comprising each node determining, based on the set of affinity information maintained by the node, whether affinity end conditions have been satisfied between the node and any of the plurality of objects with which the node currently has an affinity relationship.

8. The method of claim 7 further comprising, in response to a node determining that affinity end conditions have been satisfied between the node and a particular object, dissolving the affinity relationship between the node and the particular object.

9. The method of claim 8 further comprising, in response to dissolving the affinity relationship between the node and the particular object, remastering the resources that belong to the object using an affinity independent assignment mechanism.

10. The method of claim 1 further comprising:

each node determining, based on the set of affinity information maintained by the node, whether another node has satisfied affinity start conditions relative to an object with which the node currently has an affinity relationship; and

in response to a node determining that another node has satisfied affinity start conditions relative to an object with which the node currently has an affinity relationship, the node transferring the affinity relationship of the particular object to the other node.

11. The method of claim 1 further comprising each node aging out older affinity information from its set of affinity information.

12. The method of claim 11 wherein the step of aging out older affinity information is performed by periodically clearing at least some of the values in the set of affinity information.

13. The method of claim 12 wherein:

the set of affinity information includes values gathered during each of a plurality of monitoring periods; and

step of periodically clearing is performed by clearing the values that were gathered during the oldest monitoring period that is currently reflected in the set of affinity information.

14. The method of claim 1 wherein the set of affinity information maintained by each node includes information about the frequency at which other nodes within the system are accessing each object of the plurality of objects

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 1.

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 2.

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 3.

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 4.

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 5.

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 6.

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 7.

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 8.

23. 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.

24. 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.

25. 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.

26. 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 12.

27. 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 13.

28. 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 14.