| 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(); |
| 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 |
|
} |
| 61 |
|
actions[i] = new CyclicBarrierAction(i, barrier, size); |
| 62 |
|
} |
| 63 |
|
|
| 64 |
< |
Future[] futures = new Future[k]; |
| 64 |
> |
Future<?>[] futures = new Future<?>[k]; |
| 65 |
|
for (int i = 0; i < k; ++i) { |
| 66 |
|
futures[i] = pool.submit(actions[i]); |
| 67 |
|
} |
