1 |
dl |
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 |
5 |
|
|
*/ |
6 |
|
|
|
7 |
|
|
import java.util.*; |
8 |
|
|
import java.util.concurrent.*; |
9 |
|
|
//import jsr166y.*; |
10 |
|
|
|
11 |
|
|
/* |
12 |
|
|
* Based loosely on Java Grande Forum barrierBench |
13 |
|
|
*/ |
14 |
|
|
|
15 |
|
|
public class FJPhaserLoops { |
16 |
|
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
17 |
|
|
static final int FIRST_SIZE = 10000; |
18 |
|
|
static final int LAST_SIZE = 1000000; |
19 |
|
|
/** for time conversion */ |
20 |
|
|
static final long NPS = (1000L * 1000 * 1000); |
21 |
|
|
|
22 |
|
|
static final class PhaserAction extends RecursiveAction { |
23 |
|
|
final int id; |
24 |
|
|
final int size; |
25 |
|
|
final Phaser phaser; |
26 |
|
|
public PhaserAction(int id, Phaser b, int size) { |
27 |
|
|
this.id = id; |
28 |
|
|
this.phaser = b; |
29 |
|
|
this.size = size; |
30 |
|
|
phaser.register(); |
31 |
|
|
} |
32 |
|
|
|
33 |
|
|
public void compute() { |
34 |
|
|
int n = size; |
35 |
|
|
Phaser b = phaser; |
36 |
|
|
for(int i = 0; i < n; ++i) |
37 |
|
|
b.arriveAndAwaitAdvance(); |
38 |
|
|
} |
39 |
|
|
} |
40 |
|
|
|
41 |
|
|
public static void main(String[] args) throws Exception { |
42 |
|
|
int nthreads = NCPUS; |
43 |
|
|
if (args.length > 0) |
44 |
|
|
nthreads = Integer.parseInt(args[0]); |
45 |
|
|
|
46 |
|
|
System.out.printf("max %d Threads\n", nthreads); |
47 |
|
|
|
48 |
|
|
for (int k = 2; k <= nthreads; k *= 2) { |
49 |
|
|
ForkJoinPool pool = new ForkJoinPool(k); |
50 |
|
|
|
51 |
|
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
52 |
|
|
long startTime = System.nanoTime(); |
53 |
|
|
|
54 |
|
|
Phaser phaser = new Phaser(); |
55 |
|
|
final PhaserAction[] actions = new PhaserAction[k]; |
56 |
|
|
for (int i = 0; i < k; ++i) { |
57 |
|
|
actions[i] = new PhaserAction(i, phaser, size); |
58 |
|
|
} |
59 |
|
|
|
60 |
|
|
pool.invoke(new RecursiveAction() { |
61 |
|
|
public void compute() { invokeAll(actions); }}); |
62 |
|
|
|
63 |
|
|
long elapsed = System.nanoTime() - startTime; |
64 |
|
|
long bs = (NPS * size) / elapsed; |
65 |
|
|
System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n", |
66 |
|
|
k, size, bs); |
67 |
|
|
} |
68 |
|
|
pool.shutdown(); |
69 |
|
|
} |
70 |
|
|
} |
71 |
|
|
|
72 |
|
|
} |
73 |
|
|
|
74 |
|
|
|