I am getting into Semaphores in Java and was reading this article http://docs.oracle.com/javase/1.5.0/docs/api/java/util/concurrent/Semaphore.html . The only thing I don\'t
synchronization is guaranteed by AbstractQueuedSynchronizer with CAS operations
see the javadoc here
Semaphores ought to be fast and therefore use the atomic concurrency primitives from the Unsafe
class, like CAS (compare and swap).
With these primitives synchronization happens on a much lower level and monitors are not needed. (Lock-free synchronization).
In fact the synchronization is performed by a loop continously using CAS until the expected value equals the written/read value.
Or, does the semaphore itself handle the synchronization?
Yes that's basically it. Semaphores are thread safe as explained in the javadoc:
Memory consistency effects: Actions in a thread prior to calling a "release" method such as release() happen-before actions following a successful "acquire" method such as acquire() in another thread.
Most operations on the objects in the java.util.concurrent
package are thread safe. More details are provided at the very bottom of the package javadoc.