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.8 by jsr166, Sat Dec 31 19:42:12 2016 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.*;
7 > import java.util.concurrent.CyclicBarrier;
8 > import java.util.concurrent.ExecutorService;
9 > import java.util.concurrent.Executors;
10 > import java.util.concurrent.Future;
11  
12 < /*
12 > /**
13   * Based loosely on Java Grande Forum barrierBench
14   */
14 –
15   public class CyclicBarrierLoops {
16      static final int NCPUS = Runtime.getRuntime().availableProcessors();
17      static final ExecutorService pool = Executors.newCachedThreadPool();
# Line 30 | Line 30 | public class CyclicBarrierLoops {
30              this.size = size;
31          }
32  
33 –
33          public void run() {
34              try {
35                  int n = size;
36                  CyclicBarrier b = barrier;
37 <                for(int i = 0; i < n; ++i)
37 >                for (int i = 0; i < n; ++i)
38                      b.await();
39              }
40 <            catch(Exception ex) {
40 >            catch (Exception ex) {
41                  throw new Error(ex);
42              }
43          }
# Line 51 | Line 50 | public class CyclicBarrierLoops {
50              nthreads = Integer.parseInt(args[0]);
51  
52          System.out.printf("max %d Threads\n", nthreads);
53 <        
53 >
54          for (int k = 2; k <= nthreads; k *= 2) {
55              for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) {
56                  long startTime = System.nanoTime();
57 <                
57 >
58                  CyclicBarrier barrier = new CyclicBarrier(k);
59                  CyclicBarrierAction[] actions = new CyclicBarrierAction[k];
60                  for (int i = 0; i < k; ++i) {
61                      actions[i] = new CyclicBarrierAction(i, barrier, size);
62                  }
63 <                
64 <                Future[] futures = new Future[k];
63 >
64 >                Future<?>[] futures = new Future<?>[k];
65                  for (int i = 0; i < k; ++i) {
66                      futures[i] = pool.submit(actions[i]);
67                  }
# Line 77 | Line 76 | public class CyclicBarrierLoops {
76          }
77          pool.shutdown();
78      }
80 –    
81 – }
82 –
79  
80 + }

Diff Legend

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