Using local locks for global synchronization in multi-node systems

• US 8,224,977 B2
• Filed: 11/06/2007
• Issued: 07/17/2012
• Est. Priority Date: 05/09/2003
• Status: Expired due to Term

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Loaiza, Juan, Chandrasekaran, Sashikanth, MacNaughton, Neil
• Primary Examiner(s): Tiv, Backhean
• Application Number:
  US11/936,010
• Publication Number:
  US 20080059471A1
• Time in Patent Office: 1,715 Days
• Field of Search: 709/229
• US Class Current: 709/229
• CPC Class Codes: G06F 9/526 Mutual exclusion algorithms

Abstract

Described herein are techniques for global synchronization that under various scenarios eliminate or defer the acquisition of global locks. In many cases, the need to acquire global locks is eliminated, thereby saving the overhead attendant to processing global locks.

Claims

1. A method for managing locks granted by a multi-node system to access a set of shared resources that includes a first shared resource, the method comprising the steps of:

while no global lock on said first shared resource is held, granting a first local lock on the first shared resource to a first node within the multi-node system;

while said first node holds said first local lock;

based on the first local lock, permitting the first node to access the first shared resource; and

receiving a request from a second node in said multi-node system for a global lock on the first shared resource;

in response to said request from a second node in said multi-node system for a global lock on the first shared resource;

causing said first node to obtain a global lock on the first shared resource; and

causing said second node to obtain a global lock on the first shared resource; and

wherein the method is performed by one or more computing devices.

2. The method of claim 1, wherein:

the method further includes receiving a request from the first node for a lock on the first shared resource that allows the first node to access the first shared resource;

the method further includes determining, based on one or more conditions, whether to honor the request from the first node by granting only a local lock; and

the step of granting a first local lock on the first shared resource to a first node within the multi-node system is performed in response determining to honor the request from the first node by granting only a local lock.

3. The method of claim 2, wherein the one or more conditions include that the first shared resource is not globally locked by another node.

4. The method of claim 2, wherein the one or more conditions include that the first shared resource is mastered by another node other than the first node.

5. The method of claim 1, wherein the first shared resource is mastered by the first node.

6. The method of claim 1, the method further including permitting processes on the first node to access the first shared resource based on a local lock granted by the first node to each of the processes.

7. The method of claim 1, wherein the step of granting a first local lock is performed in response to the first node creating the first shared resource.

8. The method of claim 7, wherein the first shared resource is mastered by another node other than the first node.

9. A non-transitory computer-readable storage medium storing one or more sequences of instructions for managing locks granted by a multi-node system to access a set of shared resources that includes a first shared resource, said one or more sequences of instructions, which, when executed by one or more processors, causes the one or more processors to perform steps of:

while no global lock on said first shared resource is held, granting a first local lock on the first shared resource to a first node within the multi-node system;

while said first node holds said first local lock;

based on the first local lock, permitting the first node to access the first shared resource; and

receiving a request from a second node in said multi-node system for a global lock on the first shared resource; and

in response to said request from a second node in said multi-node system for a global lock on the first shared resource;

causing said first node to obtain a global lock on the first shared resource; and

causing said second node to obtain a global lock on the first shared resource.

10. The non-transitory computer-readable storage medium of claim 9, wherein:

the method further includes receiving a request from the first node for a lock on the first shared resource that allows the first node to access the first shared resource;

the method further includes determining, based on one or more conditions, whether to honor the request from the first node by granting only a local lock; and

the step of granting a first local lock on the first shared resource to a first node within the multi-node system is performed in response determining to honor the request from the first node by granting only a local lock.

11. The non-transitory computer-readable storage medium of claim 10, wherein the one or more conditions include that the first shared resource is not globally locked by another node.

12. The non-transitory computer-readable storage medium of claim 10, wherein the one or more conditions include that the first shared resource is mastered by another node other than the first node.

13. The non-transitory computer-readable storage medium of claim 9, wherein the first shared resource is mastered by the first node.

14. The non-transitory computer-readable storage medium of claim 9, the computer-readable storage medium further including permitting processes on the first node to access the first shared resource based on a local lock granted by the first node to each of the processes.

15. The non-transitory computer-readable storage medium of claim 9, wherein the step of granting a first local lock is performed in response to the first node creating the first shared resource.

16. The non-transitory computer-readable storage medium of claim 15, wherein the first shared resource is mastered by another node other than the first node.