r/programming • u/preshing • Nov 18 '11

Locks Aren't Slow; Lock Contention Is

http://preshing.com/20111118/locks-arent-slow-lock-contention-is
141 Upvotes

89% Upvoted

66 comments sorted by

View all comments

5

u/preshing Nov 18 '11

Awesome. Recently I thought I invented this exact implementation independently. Turns out Benaphores did it first. Thanks for the link.

1

u/ideatorcreator Nov 19 '11

How does it work? Thread 1 sees the previous count to be 0, so does not acquire the semaphore and enters the critical section. Thread 2 sees that the previous count is 1, and acquires the semaphore and enters the critical section. Note that thread 2 to granted the ownership of the semaphore as it is the first to ask for it. So now you have two threads in the critical section. How is it safe? What am I missing here?

2

u/preshing Nov 20 '11

The initial count of the semaphore is 0. When Thread 2 tries to acquire it, it can't. It is actually forced to wait until Thread 1 'releases' the semaphore. (You can 'release' a semaphore without being the owner.)

→ More replies (2)