Creating and dissolving affinity relationships in a cluster

• US 7,493,400 B2
• Filed: 05/18/2005
• Issued: 02/17/2009
• Est. Priority Date: 05/18/2005
• Status: Active Grant

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Loaiza, Juan R., Chandrasekaran, Sashikanth, Macnaughton, Neil James Scott
• Primary Examiner(s): Donaghue; Larry D
• Application Number:
  US11/132,811
• Publication Number:
  US 20060265414A1
• Time in Patent Office: 1,371 Days
• Field of Search: 718104-107, 709226-227
• US Class Current: 709/227
• 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 mastering resources within a system that includes a plurality of nodes, the method comprising:

using an affinity-independent assignment mechanism to determine which nodes, of said plurality of nodes, master resources that belong to a first set of resources;

wherein resources within said first set of resources belong to objects for which no affinity relationship has been established;

using an affinity-based assignment mechanism to determine which nodes, of said plurality of nodes, master resources that belong to a second set of resources;

wherein resources within the second set of resources belong to objects for which an affinity relationship has been established;

wherein an affinity relationship has been established between a particular object and a particular node based on a set of factors;

wherein the set of factors includes at least one of;

how many locks the particular node has opened on the particular object relative to how many locks other nodes have opened on the particular object;

a comparison between a first cost of executing a particular command without establishing the affinity relationship, and a second cost of executing said particular command after establishing the affinity relationship;

the type of the operation specified in a command that accesses the object;

knowledge, about the object, known by the system;

user-specified affinity information; and

existence of a relationship between the particular object and another object that is in an affinity relationship with the particular node;

wherein the method is executed by a computer system.

2. The method of claim 1 further comprising:

in response to detecting that affinity start conditions are satisfied, automatically creating a new affinity relationship between a node and an object; and

in response to creating the affinity relationship, remastering at the node all resources that belong to the object.

3. The method of claim 1 further comprising:

in response to detecting that affinity end conditions are satisfied, automatically dissolving an existing affinity relationship between a node and an object; and

in response to dissolving the affinity relationship, remastering all resources that belong to the object based on assignments made by the affinity-independent assignment mechanism.

4. The method of claim 1 wherein the set of factors includes how many locks the particular node has opened on the particular object relative to how many locks other nodes have opened on the particular object.

5. The method of claim 1 wherein the set of factors includes a comparison between a first cost of executing a particular command without establishing the affinity relationship, and a second cost of executing said particular command after establishing the affinity relationship.

6. The method of claim 1 wherein the set of factors includes the type of the operation specified in a command that accesses the object.

7. The method of claim 1 wherein the set of factors includes knowledge, about the object, known by the system.

8. The method of claim 1 wherein the set of factors includes user-specified affinity information.

9. The method of claim 1 wherein the set of factors includes existence of a relationship between the particular object and another object that is in an affinity relationship with the particular node.

10. The method of claim 3 wherein:

the affinity relationship was established in response to a request to execute a command, and

the affinity relationship is automatically dissolved in response to completing the execution of the command.

11. The method of claim 1 wherein:

when a process accesses any resource in the first set of resources, causing the process to acquire a global lock on the resource regardless of the node on which the process is located; and

when a process accesses any resource in the second set of resources, determining whether the process only needs a local lock to access to the resource based, at least in part, on the node on which the process is located.

12. A computer-readable storage devide 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.

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

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

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

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

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

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

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

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

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

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