Hybrid queue and backoff computer resource lock featuring different spin speeds corresponding to multiple-states

• US 6,148,300 A
• Filed: 06/19/1998
• Issued: 11/14/2000
• Est. Priority Date: 06/19/1998
• Status: Expired due to Term

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Singhal, Ashok, Hagersten, Erik
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): TRINH, WILLIAM B
• Application Number:
  US09/100,667
• Time in Patent Office: 879 Days
• Field of Search: 707/8, 711/151, 711/152, 711/150, 711/145, 711/155
• US Class Current: 1/1
• CPC Class Codes: G06F 9/52 Program synchronisation; Mutual exclusion, e.g. by means of semaphores
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database

Abstract

A probabilistic queue lock divides requesters for a lock into at least three sets. In one embodiment, the requesters are divided into the owner of the lock, the first waiting contender, and the other waiting contenders. The first waiting contender is made probabilistically more likely to obtain the lock by having it spin faster than the other waiting contenders. Because the other waiting contenders spin more slowly, the first waiting contender is more likely to be able to observe the free lock and acquire it before the other waiting contenders notice that it is free. The first of the other waiting contenders that determines that the previous first waiting contender has acquired the lock is promoted to be the new first waiting contender and begins spinning fast. Because only the first waiting contender is spinning fast on the lock, it is probable that only the first waiting contender will attempt to acquire the lock when it becomes available.

Claims

1. A method of synchronizing access to a resource in a computer system that includes a lock corresponding to said resource and a plurality of requesters that may attempt to access said resource, wherein said lock has at least three lock states, said method comprising:

a first requester of said plurality of requesters requesting acquisition of said lock;

if said lock is in a free state, said first requester setting said lock to a held state and acquiring said lock;

if said lock is in said held state, said first requester setting said lock to a wait state and spinning fast; and

if said lock is in said wait state, said first requester spinning slow.

2. The method of claim 1 wherein spinning fast includes querying said lock at a first rate to determine if said lock is in said free state, and if said lock is in said free state then requesting acquisition of said lock.

3. The method of claim 2 wherein spinning slow includes querying said lock at a second rate to determine if said lock is in said wait state, and if said lock is not in said wait state then attempting to become said first waiting contender for said lock.

4. The method of claim 3 wherein said first rate is faster than said second rate.

5. The method of claim 4 wherein an atomic command queries and sets said lock.

6. The method of claim 3 wherein said resource is a memory location and a requester that acquires said lock accesses said memory location and then sets said lock to said free state.

7. The method of claim 3 wherein attempting to become said first waiting contender comprises querying said lock to determine a state of said lock and if said lock is in said held state then setting said lock to said wait state and said first requester spinning fast.

8. The method of claim 7 wherein if said lock is in said wait state when attempting to become said first waiting contender, then said first requester spins slow.

9. The method of claim 8 wherein if said lock is in said free state when attempting to become said first waiting contender, then said first requester requests acquisition to said lock.

10. A computer-readable storage medium comprising program instructions for synchronizing access to a resource in a computer system that includes a lock corresponding to said resource and a plurality of requesters that may attempt to access said resource, wherein said lock has at least three lock states, said program instructions operable to implement the steps of:

a first requester of said plurality of requesters requesting acquisition of said lock;

if said lock is in a free state, said first requester setting said lock to a held state and acquiring said lock;

if said lock is in said held state, said first requester setting said lock to a wait state and spinning fast; and

if said lock is in said wait state, said first requester spinning slow.

11. The medium of claim 10 wherein spinning fast includes querying said lock at a first rate to determine if said lock is in said free state, and if said lock is in said free state then requesting acquisition of said lock.

12. The medium of claim 11 wherein spinning slow includes querying said lock at a second rate to determine if said lock is in said wait state, and if said lock is not in said wait state then attempting to become said first waiting contender for said lock.

13. The medium of claim 12 wherein said first rate is faster than said second rate.

14. The medium of claim 13 wherein an atomic command queries and sets said lock.

15. The medium of claim 12 wherein said resources is a memory location and a requester that acquires said lock accesses said memory location and then sets said lock to said free state.

16. The medium of claim 12 wherein attempting to become said first waiting contender comprises querying said lock to determine a state of said lock and if said lock is in said held state then setting said lock to said wait state and said first requester spinning fast.

17. The medium of claim 16 wherein if said lock is in said wait state when attempting to become said first waiting contender, then said first requester spins slow.

18. The medium of claim 17 wherein if said lock is in said free state when attempting to become said first waiting contender, then said first requester requests acquisition to said lock.

19. A method of synchronizing access to a resource in a computer system that includes a lock corresponding to said resource and a plurality of requesters that may attempt to access said resource, wherein said lock has at least four lock states, said method comprising:

a first requester of said plurality of requesters requesting acquisition of said lock;

if said lock is in a free state, said first requester setting said lock to a first held state and acquiring said lock;

if said lock is in said first held state, said first requester setting said lock to a second held state and spinning fast;

if said lock is in said second held state, said first requester setting said lock to a wait state and spinning medium; and

if said lock is in said wait state, said first requester spinning slow.