1. Overview
In this tutorial, we'll see different ways to implement a mutex in Java.
2. Mutex
In a multithreaded application, two or more threads may need to access a shared resource at the same time, resulting in unexpected behavior. Examples of such shared resources are data-structures, input-output devices, files, and network connections.
We call this scenario a race condition. And, the part of the program which accesses the shared resource is known as the critical section. So, to avoid a race condition, we need to synchronize access to the critical section.
A mutex (or mutual exclusion) is the simplest type of synchronizer – it ensures that only one thread can execute the critical section of a computer program at a time.
To access a critical section, a thread acquires the mutex, then accesses the critical section, and finally releases the mutex. In the meantime, all other threads block till the mutex releases. As soon as a thread exits the critical section, another thread can enter the critical section.
3. Why Mutex?
First, let's take an example of a SequenceGeneraror class, which generates the next sequence by incrementing the currentValue by one each time:
1 2 3 4 5 6 7 8 9 10 | public class SequenceGenerator { private int currentValue = 0; public int getNextSequence() { currentValue = currentValue + 1; return currentValue; }} |
Now, let's create a test case to see how this method behaves when multiple threads try to access it concurrently:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 | @Testpublic void givenUnsafeSequenceGenerator_whenRaceCondition_thenUnexpectedBehavior() throws Exception { int count = 1000; Set<Integer> uniqueSequences = getUniqueSequences(new SequenceGenerator(), count); Assert.assertEquals(count, uniqueSequences.size());}private Set<Integer> getUniqueSequences(SequenceGenerator generator, int count) throws Exception { ExecutorService executor = Executors.newFixedThreadPool(3); Set<Integer> uniqueSequences = new LinkedHashSet<>(); List<Future<Integer>> futures = new ArrayList<>(); for (int i = 0; i < count; i++) { futures.add(executor.submit(generator::getNextSequence)); } for (Future<Integer> future : futures) { uniqueSequences.add(future.get()); } executor.awaitTermination(1, TimeUnit.SECONDS); executor.shutdown(); return uniqueSequences;} |
Once we execute this test case, we can see that it fails most of the time with the reason similar to:
1 2 3 4 | java.lang.AssertionError: expected:<1000> but was:<989> at org.junit.Assert.fail(Assert.java:88) at org.junit.Assert.failNotEquals(Assert.java:834) at org.junit.Assert.assertEquals(Assert.java:645) |
The uniqueSequences is supposed to have the size equal to the number of times we've executed the getNextSequence method in our test case. However, this is not the case because of the race condition. Obviously, we don't want this behavior.
So, to avoid such race conditions, we need to make sure that only one thread can execute the getNextSequence method at a time. In such scenarios, we can use a mutex to synchronize the threads.
There are various ways, we can implement a mutex in Java. So, next, we'll see the different ways to implement a mutex for our SequenceGenerator class.
4. Using synchronized keyword
First, we'll discuss the synchronized keyword, which is the simplest way to implement a mutex in Java.
Every object in Java has an intrinsic lock associated with it. The synchronized method and the synchronized block use this intrinsic lock to restrict the access of the critical section to only one thread at a time.
Therefore, when a thread invokes a synchronized method or enters a synchronized block, it automatically acquires the lock. The lock releases when the method or block completes or an exception is thrown from them.
Let's change getNextSequence to have a mutex, simply by adding the synchronized keyword:
1 2 3 4 5 6 7 8 | public class SequenceGeneratorUsingSynchronizedMethod extends SequenceGenerator { @Override public synchronized int getNextSequence() { return super.getNextSequence(); }} |
The synchronized block is similar to the synchronized method, with more control over the critical section and the object we can use for locking.
So, let's now see how we can use the synchronized block to synchronize on a custom mutex object:
1 2 3 4 5 6 7 8 9 10 11 12 | public class SequenceGeneratorUsingSynchronizedBlock extends SequenceGenerator { private Object mutex = new Object(); @Override public int getNextSequence() { synchronized (mutex) { return super.getNextSequence(); } }} |
5. Using ReentrantLock
The ReentrantLock class was introduced in Java 1.5. It provides more flexibility and control than the synchronized keyword approach.
Let's see how we can use the ReentrantLock to achieve mutual exclusion:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 | public class SequenceGeneratorUsingReentrantLock extends SequenceGenerator { private ReentrantLock mutex = new ReentrantLock(); @Override public int getNextSequence() { try { mutex.lock(); return super.getNextSequence(); } finally { mutex.unlock(); } }} |
6. Using Semaphore
Like ReentrantLock, the Semaphore class was also introduced in Java 1.5.
While in case of a mutex only one thread can access a critical section, Semaphore allows a fixed number of threads to access a critical section. Therefore, we can also implement a mutex by setting the number of allowed threads in a Semaphore to one.
Let's now create another thread-safe version of SequenceGenerator using Semaphore:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | public class SequenceGeneratorUsingSemaphore extends SequenceGenerator { private Semaphore mutex = new Semaphore(1); @Override public int getNextSequence() { try { mutex.acquire(); return super.getNextSequence(); } catch (InterruptedException e) { // exception handling code } finally { mutex.release(); } }} |
7. Using Guava's Monitor Class
So far, we've seen the options to implement mutex using features provided by Java.
However, the Monitor class of Google's Guava library is a better alternative to the ReentrantLock class. As per its documentation, code using Monitor is more readable and less error-prone than the code using ReentrantLock.
First, we'll add the Maven dependency for Guava:
1 2 3 4 5 | <dependency> <groupId>com.google.guava</groupId> <artifactId>guava</artifactId> <version>28.0-jre</version></dependency> |
Now, we'll write another subclass of SequenceGenerator using the Monitor class:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | public class SequenceGeneratorUsingMonitor extends SequenceGenerator { private Monitor mutex = new Monitor(); @Override public int getNextSequence() { mutex.enter(); try { return super.getNextSequence(); } finally { mutex.leave(); } }} |
8. Conclusion
In this tutorial, we've looked into the concept of a mutex. Also, we've seen the different ways to implement it in Java.
As always, the complete source code of the code examples used in this tutorial is available over on GitHub.
Reference:
Reference: