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 PhaserLoops { |
15 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
16 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
30 |
|
phaser.register(); |
31 |
|
} |
32 |
|
|
34 |
– |
|
33 |
|
public void run() { |
34 |
|
int n = size; |
35 |
|
Phaser b = phaser; |
36 |
< |
for(int i = 0; i < n; ++i) |
36 |
> |
for (int i = 0; i < n; ++i) |
37 |
|
b.arriveAndAwaitAdvance(); |
38 |
|
} |
39 |
|
} |
42 |
|
int nthreads = NCPUS; |
43 |
|
if (args.length > 0) |
44 |
|
nthreads = Integer.parseInt(args[0]); |
45 |
< |
|
45 |
> |
|
46 |
|
System.out.printf("max %d Threads\n", nthreads); |
47 |
< |
|
47 |
> |
|
48 |
|
for (int k = 2; k <= nthreads; k *= 2) { |
49 |
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
50 |
|
long startTime = System.nanoTime(); |
51 |
< |
|
51 |
> |
|
52 |
|
Phaser phaser = new Phaser(); |
53 |
|
PhaserAction[] actions = new PhaserAction[nthreads]; |
54 |
|
for (int i = 0; i < k; ++i) { |
55 |
|
actions[i] = new PhaserAction(i, phaser, size); |
56 |
|
} |
57 |
< |
|
58 |
< |
Future[] futures = new Future[k]; |
57 |
> |
|
58 |
> |
Future<?>[] futures = new Future<?>[k]; |
59 |
|
for (int i = 0; i < k; ++i) { |
60 |
|
futures[i] = pool.submit(actions[i]); |
61 |
|
} |
70 |
|
} |
71 |
|
pool.shutdown(); |
72 |
|
} |
75 |
– |
|
76 |
– |
} |
77 |
– |
|
73 |
|
|
74 |
+ |
} |