ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/loops/CyclicBarrierLoops.java
(Generate patch)

Comparing jsr166/src/test/loops/CyclicBarrierLoops.java (file contents):
Revision 1.1 by dl, Sun Nov 1 21:28:56 2009 UTC vs.
Revision 1.7 by jsr166, Thu Jan 15 18:34:19 2015 UTC

# Line 1 | Line 1
1   /*
2   * Written by Doug Lea with assistance from members of JCP JSR-166
3   * Expert Group and released to the public domain, as explained at
4 < * http://creativecommons.org/licenses/publicdomain
4 > * http://creativecommons.org/publicdomain/zero/1.0/
5   */
6  
7   import java.util.*;
8   import java.util.concurrent.*;
9   //import jsr166y.*;
10  
11 < /*
11 > /**
12   * Based loosely on Java Grande Forum barrierBench
13   */
14 –
14   public class CyclicBarrierLoops {
15      static final int NCPUS = Runtime.getRuntime().availableProcessors();
16      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 30 | Line 29 | public class CyclicBarrierLoops {
29              this.size = size;
30          }
31  
33 –
32          public void run() {
33              try {
34                  int n = size;
35                  CyclicBarrier b = barrier;
36 <                for(int i = 0; i < n; ++i)
36 >                for (int i = 0; i < n; ++i)
37                      b.await();
38              }
39 <            catch(Exception ex) {
39 >            catch (Exception ex) {
40                  throw new Error(ex);
41              }
42          }
# Line 51 | Line 49 | public class CyclicBarrierLoops {
49              nthreads = Integer.parseInt(args[0]);
50  
51          System.out.printf("max %d Threads\n", nthreads);
52 <        
52 >
53          for (int k = 2; k <= nthreads; k *= 2) {
54              for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
55                  long startTime = System.nanoTime();
56 <                
56 >
57                  CyclicBarrier barrier = new CyclicBarrier(k);
58                  CyclicBarrierAction[] actions = new CyclicBarrierAction[k];
59                  for (int i = 0; i < k; ++i) {
60                      actions[i] = new CyclicBarrierAction(i, barrier, size);
61                  }
62 <                
63 <                Future[] futures = new Future[k];
62 >
63 >                Future<?>[] futures = new Future<?>[k];
64                  for (int i = 0; i < k; ++i) {
65                      futures[i] = pool.submit(actions[i]);
66                  }
# Line 77 | Line 75 | public class CyclicBarrierLoops {
75          }
76          pool.shutdown();
77      }
80 –    
81 – }
82 –
78  
79 + }

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines