Page History

public final class ProcessStep implements Runnable {
  private static final Object lock = new Object();
  private static int time = 0;
  private final int step; // Do operations when field time reaches this value

  public ProcessStep(int step) {
    this.step = step;
  }

  public void run() {
    try {
      synchronized (lock) {
        while (time != step) { 
          lock.wait();  
        }

        // ... Do operations

        time++;
        lock.notify();
      }
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    }    
  }

  public static void main(String[] args) {
    for (int i = 4; i >= 0; i--) {
      new Thread(new ProcessStep(i)).start();
    }
  }
}

  // ...
  public void run() {
    try {
      synchronized (lock) {
        while (time != step) { 
          lock.wait();  
        }

        // ... Do operations

        time++;
        lock.notifyAll();
      }
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    }    
  }

public class ProcessStep implements Runnable {
  private static final Lock lock = new ReentrantLock();
  private static final Condition condition = lock.newCondition();
  private static int time = 0;
  private final int step; // Do operations when field time reaches this value

  public ProcessStep(int step) {
    this.step = step;
  }

   true to resume execution. Furthermore, if all the threads whose condition predicate evaluates to true previously held a specific lock before going into the wait state, only one of them will reacquire the lock upon being notified. Presumably, the others will resume waiting.  The {{notify()}} method wakes up only one thread, making no guarantees as to which thread is notified. If the thread's condition predicate doesn't allow the thread to proceed, the chosen thread may resume waiting, defeating the purpose of the notification.

The {{notify()}} method may only be invoked if all the following conditions are met:
* Every condition predicate in every waiting thread would be true (condition expressions in loops will be false) if a notification were received by each, independently. Furthermore, all these threads must perform the same set of operations after waking up. In other words, any one thread can be selected to wake up and resume for a single invocation of {{notify()}}.
* Only one thread is required to wake up on the notify signal. This is contingent on the condition predicate, in that, only one predicate must fulfill the condition and allow the thread to proceed. Multiple condition predicates in the same statement should be avoided.
* No untrusted code has access to the object being waited on. If untrusted code has access to this object, it can invoke {{wait()}} on the object and intercept a {{notify()}} call.

The {{java.util.concurrent}} utilities (interface {{Condition}}) provide the {{signal()}} and {{signalAll()}} methods to awaken threads that are blocked on an {{await()}} call. Much like the {{notify()}} method, the {{signal()}} method wakes up only one of the threads that is waiting on the condition and consequently, may be insecure. It is always safer to use {{signalAll()}}. 

{mc} IMHO this stuff is related, but not necessary ~DS
 albeit a small performance penalty.  Similarly, if any thread is blocked on a {{wait()}} method invocation on a Java object which is being used as a condition queue, then that thread should be notified using {{notifyAll()}}. 
CON39-J. Do not synchronize on the intrinsic locks of high-level concurrency objects {mc}


h2. Noncompliant Code Example ({{notify()}})

This noncompliant code example shows a complex multi-step process being undertaken by several threads. Each thread executes one step of the process; the step being currently performed is indicated by the {{step}} field. Each thread waits for the {{step}} field to indicate that it is time to perform the corresponding thread's step. After performing the step, each thread increments {{step}} to transfer control to the next thread. The thread then notifies the thread that is responsible for the next step, and then the first thread exits.

{code:bgColor=#FFcccc}
public final class ProcessStep implements Runnable {
  private static final Object lock = new Object();
  private static int time = 0;
  private final int step; // Do operations when field time reaches this value

  public ProcessStep(int step) {
    this.step = step;
  }

  public void run() {
    try {
      synchronized (lock) {
        while (time != step) { 
          lock.wait();  
        }

        // ... Do operations

        time++;
        lock.notify();
      }
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    }    
  }

  public static void main(String[] args) {
    for (int i = 4; i >= 0; i--) {
      new Thread(new ProcessStep(i)).start();
    }
  }
}
{code}

This noncompliant code example violates the [liveness|BB. Definitions#liveness] property. Each thread has a different condition predicate, as each requires {{step}} to have a different value before proceeding. The {{Object.notify()}} method wakes up only one thread at a time. Unless it happens to wake up the thread that is required to perform the next step, the program will deadlock and fail to make any progress.


h2. Compliant Solution ({{notifyAll()}})

In this compliant solution, all threads that have performed their own step use {{notifyAll()}} to notify other waiting threads. Consequently, the thread that is ready can perform its task, while all other threads whose condition predicates are false (loop condition expression is true), promptly resume waiting.

{code:bgColor=#ccccff}
  // ...
  public void run() {
     lock.lock();
try {
     try synchronized (lock) {
        while (time != step) { 
          conditionlock.awaitwait();  
        }

        // ... Do operations

        time++;
        conditionlock.signalnotifyAll();
      }
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    } finally {
      lock.unlock();
    }
  {code}


h2. Noncompliant publicCode staticExample void main(String[] args) {
    for (int i = 4; i >= 0; i--) {
      new Thread(new ProcessStep(i)).start({{Condition}} interface)

This noncompliant code example derives from the previous noncompliant code example but uses the {{Condition}} interface. The {{condition}} field allows the threads to wait on different condition predicates.

{code:bgColor=#FFcccc}
public class ProcessStep implements Runnable {
  private static final Lock lock = new ReentrantLock();
  private static }
final  }
}

  // ...
  public void run() {
    lock.lock();
    try {
      while (time != step) { 
        Condition condition = lock.newCondition();
  private static int time = 0;
  private final int step; // Do operations when field time reaches this value

  public ProcessStep(int step) {
    this.step = step;
  }

  public void run() {
    lock.lock();
    try {
      while (time != step) { 
        condition.await();  
      }

      // ... Do operations

      time++;
      condition.signalAllsignal();
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    } finally {
      lock.unlock();
    }
  }

// Declare classpublic asstatic final because its constructor throws an exception 
public final class ProcessStep implements Runnable { 
  private static final Lock lock = new ReentrantLockvoid main(String[] args) {
    for (int i = 4; i >= 0; i--) {
      new Thread(new ProcessStep(i)).start();
  private static int}
 time = 0;
  private final int step; // Do operations when field time reaches this value
  private static final int MAX_STEPS = 5;
  private static final Condition[] conditions = new Condition[MAX_STEPS];

  public ProcessStep(int step) {
    if (step <= MAX_STEPS}
}
{code}

Similar to {{Object.notify()}}, the {{signal()}} method may choose any one thread and awaken it.  


h2. Compliant Solution ({{signalAll()}})

This compliant solution uses the {{signalAll()}} method to resume all the waiting threads whose condition predicate allows doing so.

{code:bgColor=#ccccff}
  // ...
  public void run() {
    lock.lock();
  this.step  =try step;{
      conditions[step] = lock.newCondition();
    } else {while (time != step) { 
      throw new IllegalArgumentException("Too many threads");condition.await();  
    }
  }

  public void run() {
 // ...  lock.lock();Do operations

    try {
   time++;
     while (time != stepcondition.signalAll();
    } catch (InterruptedException ie) { 
        conditions[step].awaitThread.currentThread().interrupt(); // Reset interrupted status
    } finally }
{
      // ... Do operations
lock.unlock();
    }
  time++;
      if (step + 1 < conditions.length) {
        conditions[step + 1].signal();
      }
    } catch (InterruptedException ie) {
      Thread.currentThread().interrupt(); // Reset interrupted status
    } finally {
      lock.unlock();
    }
  }

  public static void main(String[] args) {
    for (int i = MAX_STEPS - 1; i >= 0; i--) {
      ProcessStep ms = new ProcessStep(i);
      new Thread(ms).start}
{code}


h2. Compliant Solution (unique Condition per thread)

This compliant solution assigns each thread its own condition, and makes all the {{Condition}} objects accessible to all the threads. 

{code:bgColor=#ccccff}
// Declare class as final because its constructor throws an exception 
public final class ProcessStep implements Runnable { 
  private static final Lock lock = new ReentrantLock();
  private static int time = 0;
  private final int step; // Do operations when field time reaches this value
  private static final int MAX_STEPS = 5;
  private static final Condition[] conditions = new Condition[MAX_STEPS];

  public ProcessStep(int step) {
    if (step <= MAX_STEPS) {
      this.step = step;
      conditions[step] = lock.newCondition();
    } else {
      throw new IllegalArgumentException("Too many threads");
    }
  }