Why do we need notify() for inter thread communication

Question

From the JAVA docs for Object notify()

The awakened thread will not be able to proceed until the current thread relinquishes the lock on this object.

This means that unless the Thread which notifes, its synchronized block is complete and it releases the lock, the waiting thread cannot proceed. If that's the case then whats the point of having notify() if the sync block is going to be executed anyway? What's the actual use of notify() if it doesn't wake up the waiting thread and let it do its job?

Answer 1

Good question. Will point you to take a look at the Thread State Class.

A thread that calls the Object.notify method enables a thread that previously called Object.wait is now enabled to be scheduled by the thread scheduler. In parlance, the thread that was waiting is now "runnable". Although it is "runnable", it is not "running".

It can only continue running when the thread invoking notify releases the lock - one way is when it exits out of the synchronized block.

There are a lot of schematics on the web on the Thread States. Some of them are completely incorrect or confusing since they introduce terminology not in the official docs. Here is one that makes sense to me.

Answer 2

Strictly speaking, we don't: we could have the waiting thread run a loop where it re-acquires the lock, checks the condition, and sleeps for a short amount of time. But using wait() and notify() is much more efficient, because then the waiting thread doesn't keep waking up and tying up CPU (and tying up the lock).

Answer 3

Notifying is what wakes up a thread that is waiting. If you remove the notify then waiting threads stay waiting (barring spurious wakeups but let’s not go there for now).

(Interrupting wakes up the thread but the guidance is to use it for cancellation only. Interruption targets a specific thread, where notifying lets the scheduler decide which threads are affected.)

When a thread calls wait it has to have the lock, then the wait method lets go of the lock.

When a thread calls notify it has to have the lock.

As a practical matter the notify can’t take effect on any waiting thread until the notifying thread relinquishes the lock. The first thing the notified thread is going to need to do anyway is to try to acquire the lock. All the passage you're quoting is trying to say is that the wakeup doesn't occur instantaneously when a thread calls notify.

So what happens here is that the notifying thread lets go of the lock and sends the notify to the scheduler, the scheduler decides which thread to notify, then the notified thread wakes up and contends for the lock in order to leave the wait method.

Answer 4

notify() and notifyAll() are used to wake up thread(s) that called wait() on the same object on which notify() or notifyAll() is called. Without call to notify() those "waiting" threads will wait forever (although JVM spec says that threads may sometime wake up without call to notify). Also because call to notify() doesn't releases the lock associated with the object itself that call usually is the last statement in a synchronized block.

So notify() is used together with wait() and not by itself. Usually the use case is like the following (blocking queue with limited size).

Method that adds element to queue (some pseudo code)

synchronized(lockObject) {
    if (size < LIMIT) {
        addElement();
        lockObject.notifyAll(); //notifying threads that are waiting to get element from empty queue
    } else {
        lockObject.wait(); // waiting for other thread to get element from queue and make room for new element
    }
}

Method that gets element

synchronized(lockObject) {
    if (size > 0) {
        getElement();
        lockObject.notifyAll(); // notify threads that there is a room for new element
    } else {
        lockObject.wait(); // waiting for other thread to put element into the queue
    }
} 

Also calling lockObject.wait() releases lock on lockObject. More details regarding that could be found here: Java : Does wait() release lock from synchronized block

Answer 5

Imagine if you need a thread to wait for another thread to do something that it may or may not even currently be actively working on. For example, a thread that's waiting for a job to do may need to wait until another thread has put a job on the list of jobs it should do if that list is empty. How would you do this?

You can't just use some form of mutual exclusion. There may be long periods of time when there's no work to do and not thread holds any lock on the queue. There may just not be any work to do right now. The thread that does work needs to wait, without holding any lock, until another thread has given it some work to do.

So somewhere, there's a thread that does something like this:

1. Acquire the lock that protects some shared state that another thread might be waiting for a change to. (In this case, the job queue.)
2. Change the shared state to reflect the fact that the thing a thread might need to wait for has happened. (That is, put a job on the queue.)
3. Release the lock and let any waiting thread(s) know that the thing has happened.

So what could our code to wait look like? Perhaps:

1. Acquire the lock that protects the shared state.
2. Check whether we need to wait or not. (Is there a job on the queue?)
3. If we need to wait, wait. (If not, wait for a job to be placed on the queue.) ...

Oops, we have a problem. The thing we're waiting for can't happen because we hold the lock. No other thread can change the shared state. (Our thread to put a job on the queue can't touch the queue until we release the lock we acquired in step 1.)

Let's try it again:

1. Acquire the lock that protects the shared state.
2. Check whether we need to wait or not. (Is there a job on the queue?)
3. If we don't need to wait, exit this algorithm. (If there's a job, take it off the queue, release the lock, and do it.)
4. Release the lock. (So another thread can put a job on the queue.)
5. Wait for the thing to happen.
   ...

Oops, we have another problem. What if the thing we're waiting for happens after step 4 but before step 5. Since the lock has been released, the thing we're waiting for can happen. We can't check again because we don't hold the lock. How can we ensure we don't wait for something that has already happened, which may mean waiting forever?

To solve this, we need an atomic "unlock and wait" operation. That's what wait does. And we also need some operation that can end this wait that can be called by the thread that changed the shared state so that we no longer need to wait. That's what notify does.