Examples of Phaser

co.paralleluniverse.strands.concurrent.Phaser
to register self // create and start threads for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { phaser.arriveAndAwaitAdvance(); // await all creation task.run(); } }.start(); } // allow threads to start and deregister self phaser.arriveAndDeregister(); }}
One way to cause a set of threads to repeatedly perform actions for a given number of iterations is to override {@code onAdvance}:
```
  {@code}void startTasks(List tasks, final int iterations)  final Phaser phaser = new Phaser() { protected boolean onAdvance(int phase, int registeredParties) { return phase >= iterations || registeredParties == 0; } }; phaser.register(); for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { do { task.run(); phaser.arriveAndAwaitAdvance(); } while (!phaser.isTerminated()); } }.start(); } phaser.arriveAndDeregister(); // deregister self, don't wait }}
```
If the main task must later await termination, it may re-register and then execute a similar loop:
```
  {@code // ... phaser.register(); while (!phaser.isTerminated()) phaser.arriveAndAwaitAdvance();}
```
Related constructions may be used to await particular phase numbers in contexts where you are sure that the phase will never wrap around {@code Integer.MAX_VALUE}. For example:
```
  {@code}void awaitPhase(Phaser phaser, int phase)  int p = phaser.register(); // assumes caller not already registered while (p < phase) { if (phaser.isTerminated()) // ... deal with unexpected termination else p = phaser.arriveAndAwaitAdvance(); } phaser.arriveAndDeregister(); }}
```
To create a set of {@code n} tasks using a tree of phasers, youcould use code of the following form, assuming a Task class with a constructor accepting a {@code Phaser} that it registers with uponconstruction. After invocation of {@code build(new Task[n], 0, n,new Phaser())}, these tasks could then be started, for example by submitting to a pool:
```
  {@code}void build(Task[] tasks, int lo, int hi, Phaser ph)  if (hi - lo > TASKS_PER_PHASER) { for (int i = lo; i < hi; i += TASKS_PER_PHASER) { int j = Math.min(i + TASKS_PER_PHASER, hi); build(tasks, i, j, new Phaser(ph)); } } else { for (int i = lo; i < hi; ++i) tasks[i] = new Task(ph); // assumes new Task(ph) performs ph.register() } }}
```
The best value of {@code TASKS_PER_PHASER} depends mainly onexpected synchronization rates. A value as low as four may be appropriate for extremely small per-phase task bodies (thus high rates), or up to hundreds for extremely large ones.
Implementation notes: This implementation restricts the maximum number of parties to 65535. Attempts to register additional parties result in {@code IllegalStateException}. However, you can and should create tiered phasers to accommodate arbitrarily large sets of participants. @since 1.7 @author Doug Lea
hj.lang.phaser
@author bchase
java.util.concurrent.Phaser
to register self // create and start threads for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { phaser.arriveAndAwaitAdvance(); // await all creation task.run(); } }.start(); } // allow threads to start and deregister self phaser.arriveAndDeregister(); }}
One way to cause a set of threads to repeatedly perform actions for a given number of iterations is to override {@code onAdvance}:
```
  {@code}void startTasks(List tasks, final int iterations)  final Phaser phaser = new Phaser() { protected boolean onAdvance(int phase, int registeredParties) { return phase >= iterations || registeredParties == 0; } }; phaser.register(); for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { do { task.run(); phaser.arriveAndAwaitAdvance(); } while (!phaser.isTerminated()); } }.start(); } phaser.arriveAndDeregister(); // deregister self, don't wait }}
```
If the main task must later await termination, it may re-register and then execute a similar loop:
```
  {@code // ... phaser.register(); while (!phaser.isTerminated()) phaser.arriveAndAwaitAdvance();}
```
Related constructions may be used to await particular phase numbers in contexts where you are sure that the phase will never wrap around {@code Integer.MAX_VALUE}. For example:
```
  {@code}void awaitPhase(Phaser phaser, int phase)  int p = phaser.register(); // assumes caller not already registered while (p < phase) { if (phaser.isTerminated()) // ... deal with unexpected termination else p = phaser.arriveAndAwaitAdvance(); } phaser.arriveAndDeregister(); }}
```
To create a set of {@code n} tasks using a tree of phasers, youcould use code of the following form, assuming a Task class with a constructor accepting a {@code Phaser} that it registers with uponconstruction. After invocation of {@code build(new Task[n], 0, n,new Phaser())}, these tasks could then be started, for example by submitting to a pool:
```
  {@code}void build(Task[] tasks, int lo, int hi, Phaser ph)  if (hi - lo > TASKS_PER_PHASER) { for (int i = lo; i < hi; i += TASKS_PER_PHASER) { int j = Math.min(i + TASKS_PER_PHASER, hi); build(tasks, i, j, new Phaser(ph)); } } else { for (int i = lo; i < hi; ++i) tasks[i] = new Task(ph); // assumes new Task(ph) performs ph.register() } }}
```
The best value of {@code TASKS_PER_PHASER} depends mainly onexpected synchronization rates. A value as low as four may be appropriate for extremely small per-phase task bodies (thus high rates), or up to hundreds for extremely large ones.
Implementation notes: This implementation restricts the maximum number of parties to 65535. Attempts to register additional parties result in {@code IllegalStateException}. However, you can and should create tiered phasers to accommodate arbitrarily large sets of participants. @since 1.7 @author Doug Lea
jsr166y.Phaser
to register self // create and start threads for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { phaser.arriveAndAwaitAdvance(); // await all creation task.run(); } }.start(); } // allow threads to start and deregister self phaser.arriveAndDeregister(); }}
One way to cause a set of threads to repeatedly perform actions for a given number of iterations is to override {@code onAdvance}:
```
  {@code}void startTasks(List tasks, final int iterations)  final Phaser phaser = new Phaser() { protected boolean onAdvance(int phase, int registeredParties) { return phase >= iterations || registeredParties == 0; } }; phaser.register(); for (final Runnable task : tasks) { phaser.register(); new Thread() { public void run() { do { task.run(); phaser.arriveAndAwaitAdvance(); } while (!phaser.isTerminated()); } }.start(); } phaser.arriveAndDeregister(); // deregister self, don't wait }}
```
If the main task must later await termination, it may re-register and then execute a similar loop:
```
  {@code // ... phaser.register(); while (!phaser.isTerminated()) phaser.arriveAndAwaitAdvance();}
```
Related constructions may be used to await particular phase numbers in contexts where you are sure that the phase will never wrap around {@code Integer.MAX_VALUE}. For example:
```
  {@code}void awaitPhase(Phaser phaser, int phase)  int p = phaser.register(); // assumes caller not already registered while (p < phase) { if (phaser.isTerminated()) // ... deal with unexpected termination else p = phaser.arriveAndAwaitAdvance(); } phaser.arriveAndDeregister(); }}
```
To create a set of {@code n} tasks using a tree of phasers, youcould use code of the following form, assuming a Task class with a constructor accepting a {@code Phaser} that it registers with uponconstruction. After invocation of {@code build(new Task[n], 0, n,new Phaser())}, these tasks could then be started, for example by submitting to a pool:
```
  {@code}void build(Task[] tasks, int lo, int hi, Phaser ph)  if (hi - lo > TASKS_PER_PHASER) { for (int i = lo; i < hi; i += TASKS_PER_PHASER) { int j = Math.min(i + TASKS_PER_PHASER, hi); build(tasks, i, j, new Phaser(ph)); } } else { for (int i = lo; i < hi; ++i) tasks[i] = new Task(ph); // assumes new Task(ph) performs ph.register() } }}
```
The best value of {@code TASKS_PER_PHASER} depends mainly onexpected synchronization rates. A value as low as four may be appropriate for extremely small per-phase task bodies (thus high rates), or up to hundreds for extremely large ones.
Implementation notes: This implementation restricts the maximum number of parties to 65535. Attempts to register additional parties result in {@code IllegalStateException}. However, you can and should create tiered phasers to accommodate arbitrarily large sets of participants. @since 1.7 @author Doug Lea

Examples of co.paralleluniverse.strands.concurrent.Phaser

        this.N = Integer.parseInt(props.getProperty("N", "10000"));
        this.speedVariance = Double.parseDouble(props.getProperty("speed-variance", "1"));
        this.range = Double.parseDouble(props.getProperty("radar-range", "10"));
        this.extrapolate = Boolean.parseBoolean(props.getProperty("extrapolate", "true"));


        this.phaser = Boolean.parseBoolean(props.getProperty("phaser", "false")) ? new Phaser() : null;


        if (props.getProperty("dir") != null) // collect performance metrics in csv files
            createMetricsFiles(props);


        println("Galaxy node: " + (glxNode > 0 ? glxNode : " NOT DISTRIBUTED"));

View Full Code Here

Examples of hj.lang.phaser

        }
        
        if (isFirstSingle>0) {
            Iterator<phaser> it = singlePhasers.iterator();
            while (it.hasNext()) {
                phaser ph = it.next();
                ph.holdSingle(this);
            }
        }
        
        return isFirstSingle;
    }

View Full Code Here

Examples of hj.lang.phaser

    public void unregisterAllPhasers(Activity owner) {
        lock.lock();
        try {
            Iterator<phaser> iter= phasers.iterator();
            while (iter.hasNext()) {
                phaser ph = iter.next();
                ph.unregisterSignaler(owner);
                ph.unregisterWaiter(owner);
            }
        } finally {
            lock.unlock();
        }
    }

View Full Code Here

Examples of java.util.concurrent.Phaser

  /**
   * @param args
   */
  public static void main(String[] args) {
    byte threadNumber = 2;
    Phaser phaser = new Phaser();
    for (byte i = 1; i <= threadNumber; i++)
      new Thread(new PhasedTask(phaser, i)).start();
    
  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   * @param args
   */
  public static void main(String[] args) {
    
    // Creates a Phaser with three participants
    Phaser phaser=new Phaser(3);
    
    // Creates 3 FileSearch objects. Each of them search in different directory
    FileSearch system=new FileSearch("C:\\Windows", "log", phaser);
    FileSearch apps=new FileSearch("C:\\Program Files","log",phaser);
    FileSearch documents=new FileSearch("C:\\Documents And Settings","log",phaser);
    
    // Creates a thread to run the system FileSearch and starts it
    Thread systemThread=new Thread(system,"System");
    systemThread.start();
    
    // Creates a thread to run the apps FileSearch and starts it
    Thread appsThread=new Thread(apps,"Apps");
    appsThread.start();
    
    // Creates a thread to run the documents  FileSearch and starts it
    Thread documentsThread=new Thread(documents,"Documents");
    documentsThread.start();
    try {
      systemThread.join();
      appsThread.join();
      documentsThread.join();
    } catch (InterruptedException e) {
      e.printStackTrace();
    }
    
    System.out.printf("Terminated: %s\n",phaser.isTerminated());


  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   */
  public static void main(String[] args) throws Exception {
    /*
     * Create a new Phaser for three participants
     */
    Phaser phaser=new Phaser(3);
    
    /*
     * Create and launch three tasks
     */
    for (int i=0; i<3; i++) {
      Task task=new Task(i+1, phaser);
      Thread thread=new Thread(task);
      thread.start();
    }
    
    /*
     * Write information about the Phaser
     */
    for (int i=0; i<10; i++) {
      System.out.printf("********************\n");
      System.out.printf("Main: Phaser Log\n");
      System.out.printf("Main: Phaser: Phase: %d\n",phaser.getPhase());
      System.out.printf("Main: Phaser: Registered Parties: %d\n",phaser.getRegisteredParties());
      System.out.printf("Main: Phaser: Arrived Parties: %d\n",phaser.getArrivedParties());
      System.out.printf("Main: Phaser: Unarrived Parties: %d\n",phaser.getUnarrivedParties());
      System.out.printf("********************\n");


      TimeUnit.SECONDS.sleep(1);
    }
  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   */
  @Test
  public void illegalStateClearBlocked1() throws ParserException {
    initAvoidance();
    // we do not use the Byteman integration     
    final Phaser a = new pt.ul.jarmus.ext.Phaser(1);
    final Phaser b = new pt.ul.jarmus.ext.Phaser(1);
    JArmus.register(a);
    JArmus.register(b);
    b.arriveAndAwaitAdvance();
    a.arriveAndAwaitAdvance();
  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   */
  @Test
  public void illegalStateClearBlocked2() throws ParserException {
    initAvoidance();
        
    final Phaser a = new Phaser(1);
    final Phaser b = new Phaser(1);
    JArmus.register(a);
    JArmus.register(b);
    b.arriveAndAwaitAdvance();
    a.arriveAndAwaitAdvance();
  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   */
  @Test
  public void falseDeadlock1a() {
    initAvoidance();
        
    final Phaser a = new pt.ul.jarmus.ext.Phaser(1);
    final Phaser b = new pt.ul.jarmus.ext.Phaser(1);
    JArmus.register(a);
    JArmus.register(b);
    b.arrive();
    a.arriveAndAwaitAdvance();
    b.awaitAdvance(0);
  }

View Full Code Here

Examples of java.util.concurrent.Phaser

   */
  @Test
  public void falseDeadlock1b() throws InterruptedException, InstantiationException, IllegalAccessException {
    initAvoidance();
        
    final Phaser a = new Phaser(1);
    final Phaser b = new Phaser(1);
    JArmus.register(a);
    JArmus.register(b);
    b.arrive();
    a.arriveAndAwaitAdvance();
    b.awaitAdvance(0);
  }

View Full Code Here

0 1 2 3

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.