Semaphore and SemaphoreSlim
The Semaphore class represents a named (systemwide) or local semaphore. It is a thin wrapper around the Win32 semaphore object. Win32 semaphores are counting semaphores, which can be used to control access to a pool of resources.
The SemaphoreSlim class represents a lightweight, fast semaphore that can be used for waiting within a single process when wait times are expected to be very short. SemaphoreSlim relies as much as possible on synchronization primitives provided by the common language runtime (CLR). However, it also provides lazily initialized, kernel-based wait handles as necessary to support waiting on multiple semaphores. SemaphoreSlim also supports the use of cancellation tokens, but it does not support named semaphores or the use of a wait handle for synchronization.
Threads enter the semaphore by calling the WaitOne method, which is inherited from the WaitHandle class. When the call returns, the count on the semaphore is decremented. When a thread requests entry and the count is zero, the thread blocks. As threads release the semaphore by calling the SemaphoreRelease method, blocked threads are allowed to enter. There is no guaranteed order, such as first-in, first-out (FIFO) or last-in, first-out (LIFO), for blocked threads to enter the semaphore.
A thread can enter the semaphore multiple times by calling the WaitOne method repeatedly. To release the semaphore, the thread can either call the Release method overload the same number of times, or call the Release(Int32) method overload and specify the number of entries to be released.
The Semaphore class does not enforce thread identity on calls to the WaitOne and Release methods. For example, a common usage scenario for semaphores involves a producer thread and a consumer thread, with one thread always incrementing the semaphore count and the other always decrementing it.
It is the programmer's responsibility to ensure that a thread does not release the semaphore too many times. For example, suppose a semaphore has a maximum count of two, and that thread A and thread B both enter the semaphore. If a programming error in thread B causes it to call Release twice, both calls succeed. The count on the semaphore is full, and when thread A eventually calls Release, a SemaphoreFullException is thrown.
The Windows operating system allows semaphores to have names. A named semaphore is system wide. That is, once the named semaphore is created, it is visible to all threads in all processes. Thus, named semaphore can be used to synchronize the activities of processes as well as threads.
You can create a Semaphore object that represents a named system semaphore by using one of the constructors that specifies a name.
Because named semaphores are system wide, it is possible to have multiple Semaphore objects that represent the same named semaphore. Each time you call a constructor or the SemaphoreOpenExisting method, a new Semaphore object is created. Specifying the same name repeatedly creates multiple objects that represent the same named semaphore.
Be careful when you use named semaphores. Because they are system wide, another process that uses the same name can enter your semaphore unexpectedly. Malicious code executing on the same computer could use this as the basis of a denial-of-service attack.
Use access control security to protect a Semaphore object that represents a named semaphore, preferably by using a constructor that specifies a SemaphoreSecurity object. You can also apply access control security using the SemaphoreSetAccessControl method, but this leaves a window of vulnerability between the time the semaphore is created and the time it is protected. Protecting semaphores with access control security helps prevent malicious attacks, but does not solve the problem of unintentional name collisions.