Operations that may seem safe are not, when threads are present : Lock Synchronize « Threads « Java






Operations that may seem safe are not, when threads are present

Operations that may seem safe are not, when threads are present
     

// : c13:SerialNumberChecker.java
// Operations that may seem safe are not,
// when threads are present.
// From 'Thinking in Java, 3rd ed.' (c) Bruce Eckel 2002
// www.BruceEckel.com. See copyright notice in CopyRight.txt.

// Reuses storage so we don't run out of memory:


class CircularSet {
  private int[] array;

  private int len;

  private int index = 0;

  public CircularSet(int size) {
    array = new int[size];
    len = size;
    // Initialize to a value not produced
    // by the SerialNumberGenerator:
    for (int i = 0; i < size; i++)
      array[i] = -1;
  }

  public synchronized void add(int i) {
    array[index] = i;
    // Wrap index and write over old elements:
    index = ++index % len;
  }

  public synchronized boolean contains(int val) {
    for (int i = 0; i < len; i++)
      if (array[i] == val)
        return true;
    return false;
  }
}

public class SerialNumberChecker {
  private static CircularSet serials = new CircularSet(1000);

  static class SerialChecker extends Thread {
    SerialChecker() {
      start();
    }

    public void run() {
      while (true) {
        int serial = SerialNumberGenerator.nextSerialNumber();
        if (serials.contains(serial)) {
          System.out.println("Duplicate: " + serial);
          System.exit(0);
        }
        serials.add(serial);
      }
    }
  }

  public static void main(String[] args) {
    for (int i = 0; i < 10; i++)
      new SerialChecker();
    // Stop after 4 seconds:
    new Timeout(4000, "No duplicates detected");
  }
} ///:~
 class SerialNumberGenerator {
  private static volatile int serialNumber = 0;
  public static int nextSerialNumber() {
    return serialNumber++;
  }
} ///:~
class Timeout extends java.util.Timer {
  public Timeout(int delay, final String msg) {
    super(true); // Daemon thread
    schedule(new TimerTask() {
      public void run() {
        System.out.println(msg);
        System.exit(0);
      }
    }, delay);
  }
} ///:~


           
         
    
    
    
    
  








Related examples in the same category

1.Thread: Dining Philosophers
2.Synchronizing on another objectSynchronizing on another object
3.Synchronizing blocks instead of entire methodsSynchronizing blocks instead of entire methods
4.Boolean lockBoolean lock
5.Static synchronized blockStatic synchronized block
6.Thread notifyThread notify
7.Thread deadlockThread deadlock
8.Synchronize methodSynchronize method
9.Threads joinThreads join
10.Static synchronizeStatic synchronize
11.No synchronizeNo synchronize
12.Thread synchronizationThread synchronization
13.Synchronized Block demoSynchronized Block demo
14.Interruptible Synchronized Block Interruptible Synchronized Block
15.SignalingSignaling
16.Simple Object FIFOSimple Object FIFO
17.Object FIFOObject FIFO
18.Byte FIFOByte FIFO
19.Daemon Lock
20.Determining If the Current Thread Is Holding a Synchronized Lock
21.Handle concurrent read/write: use synchronized to lock the data
22.Lock for read and write
23.Read Write Lock
24.Coordinates threads for multi-threaded operations
25.A reader-writer lock from "Java Threads" by Scott Oak and Henry Wong.
26.Invoke a series of runnables as closely to synchronously as possible
27.This program shows how multiple threads can safely access a data structure, using synchronized methods
28.This program shows data corruption when multiple threads access a data structure.
29.Stores a single object for the producer/consumer pattern and takes care of thread synchronization.
30.The BooleanLock class provides a useful encapsulation of a boolean variable that is easily and safely accessed from multiple theads.