Thread Deadlock in Java

In the world of concurrent programming, deadlocks are like hidden time bombs waiting to disrupt the smooth functioning of your application. If you’ve ever encountered a situation where your Java application appears to have frozen or become unresponsive, you might have encountered a deadlock. In this blog post, we’ll learn the concept of thread deadlock in Java, exploring their causes, symptoms, prevention strategies, and ways to handle them when they do occur.

What is a Deadlock?

A deadlock is a scenario in which two or more threads are blocked indefinitely, each waiting for a resource that the other holds. Essentially, these threads end up in a circular dependency, where none of them can make progress, leading to an application freeze or unresponsiveness.

How does deadlock happen in Java threads?

Java’s multithreading capabilities can lead to deadlocks due to its inherent complexity. Deadlocks usually arise from a combination of resource contention, inadequate synchronization, and race conditions among threads. A classic example involves two threads, Thread A and Thread B, each holding a resource that the other requires. If both threads are not designed to release their held resources properly, a deadlock can occur.

Symptoms of a Deadlock

Detecting a deadlock can be tricky, as it might not always result in a crash or error message. Some common symptoms include:

  1. Application Freeze: The application stops responding and fails to complete any further tasks.
  2. Stalled Threads: Threads that should be progressing are stuck and not making any headway.
  3. Resource Utilization: System resources might be underutilized due to threads being blocked.

Causes of Deadlocks

Several factors can contribute to the occurrence of deadlocks:

  1. Resource Contention: Threads competing for limited resources without a proper release mechanism.
  2. Inadequate Synchronization: Improper use of synchronization mechanisms like locks and semaphores.
  3. Race Conditions: Concurrent access to shared resources without proper synchronization, leading to unpredictable behavior.

Prevention of Deadlocks

Preventing deadlocks requires a combination of good design practices and proper coding techniques:

  1. Avoiding Resource Contention: Minimize scenarios where threads compete for resources excessively.
  2. Using Proper Synchronization: Ensure that threads acquire and release resources in a controlled manner using synchronized blocks or locks.
  3. Avoiding Race Conditions: Implement thread-safe practices to prevent multiple threads from accessing shared resources simultaneously.

Dealing with Deadlocks

When dealing with deadlocks, it’s important to have strategies in place to detect and recover from them:

  1. Detecting Deadlocks: Utilize tools or monitoring mechanisms to identify deadlocked threads, often through analyzing thread dumps or profiling tools.
  2. Recovering from Deadlocks: In some cases, you might need to forcibly terminate the affected threads or restart the application. However, this can have consequences, such as data corruption or loss.

Example of Deadlock in Java

public class DeadlockDemo {

    private static Object resource1 = new Object();
    private static Object resource2 = new Object();

    public static void main(String[] args) throws InterruptedException {
        Thread thread1 = new Thread(() -> {
            synchronized (resource1) {
                System.out.println("Thread 1: Acquired resource 1");
                try {
                } catch (InterruptedException e) {
                synchronized (resource2) {
                    System.out.println("Thread 1: Acquired resource 2");

        Thread thread2 = new Thread(() -> {
            synchronized (resource2) {
                System.out.println("Thread 2: Acquired resource 2");
                try {
                } catch (InterruptedException e) {
                synchronized (resource1) {
                    System.out.println("Thread 2: Acquired resource 1");



In this example, two threads are trying to acquire the same two resources in the opposite order. This will cause a deadlock, because each thread will be waiting for the other thread to release a resource that it needs. Let’s analyze the code step by step:

  1. Two threads (thread1 and thread2) are created, and each thread acquires locks on different resources (resource1 and resource2).
  2. thread1 starts and locks resource1.
  3. thread2 starts and locks resource2.
  4. thread1 attempts to lock resource2 but gets blocked because it’s held by thread2.
  5. thread2 attempts to lock resource1 but gets blocked because it’s held by thread1.

Both threads are now blocked and waiting for a resource that the other thread is holding, resulting in a deadlock. The program will hang indefinitely without any further output.

If you run this code, you’ll likely see output similar to the following:

Thread 1: Acquired resource 1
Thread 2: Acquired resource 2

To prevent this deadlock, we can change the order in which the threads acquire the resources. For example, we could change the code so that thread1 first acquires resource2 and then resource1, and thread2 first acquires resource1 and then resource2. This would prevent the deadlock, because each thread would be able to acquire the resources that it needs without waiting for the other thread.


What is a livelock, and how does it differ from deadlock?

A livelock is a situation where two or more threads are actively trying to resolve a conflict, but their actions lead to no progress, similar to a deadlock. The key difference is that in a livelock, threads are not simply blocked; they are actively trying to resolve the situation, leading to a futile cycle.

How to break a thread deadlock in Java?

Breaking a thread deadlock typically involves releasing one or more resources held by threads or forcibly terminating one or more threads involved in the deadlock. However, breaking a deadlock should be done with caution, as it can lead to data corruption.