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 TieredPhaserLoops { |
16 |
|
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
17 |
|
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
18 |
|
|
static final int FIRST_SIZE = 10000; |
19 |
|
|
static final int LAST_SIZE = 1000000; |
20 |
|
|
/** for time conversion */ |
21 |
|
|
static final long NPS = (1000L * 1000 * 1000); |
22 |
|
|
|
23 |
|
|
static int tasksPerPhaser = Math.max(NCPUS / 8, 4); |
24 |
|
|
|
25 |
|
|
static void build(Runnable[] actions, int sz, int lo, int hi, Phaser b) { |
26 |
|
|
int step = (hi - lo) / tasksPerPhaser; |
27 |
|
|
if (step > 1) { |
28 |
|
|
int i = lo; |
29 |
|
|
while (i < hi) { |
30 |
|
|
int r = Math.min(i + step, hi); |
31 |
|
|
build(actions, sz, i, r, new Phaser(b)); |
32 |
|
|
i = r; |
33 |
|
|
} |
34 |
|
|
} |
35 |
|
|
else { |
36 |
|
|
for (int i = lo; i < hi; ++i) |
37 |
|
|
actions[i] = new PhaserAction(i, b, sz); |
38 |
|
|
} |
39 |
|
|
} |
40 |
|
|
|
41 |
|
|
static final class PhaserAction implements Runnable { |
42 |
|
|
final int id; |
43 |
|
|
final int size; |
44 |
|
|
final Phaser phaser; |
45 |
|
|
public PhaserAction(int id, Phaser b, int size) { |
46 |
|
|
this.id = id; |
47 |
|
|
this.phaser = b; |
48 |
|
|
this.size = size; |
49 |
|
|
phaser.register(); |
50 |
|
|
} |
51 |
|
|
|
52 |
|
|
|
53 |
|
|
public void run() { |
54 |
|
|
int n = size; |
55 |
|
|
Phaser b = phaser; |
56 |
|
|
for(int i = 0; i < n; ++i) |
57 |
|
|
b.arriveAndAwaitAdvance(); |
58 |
|
|
} |
59 |
|
|
} |
60 |
|
|
|
61 |
|
|
public static void main(String[] args) throws Exception { |
62 |
|
|
int nthreads = NCPUS; |
63 |
|
|
if (args.length > 0) |
64 |
|
|
nthreads = Integer.parseInt(args[0]); |
65 |
|
|
if (args.length > 1) |
66 |
|
|
tasksPerPhaser = Integer.parseInt(args[1]); |
67 |
|
|
|
68 |
|
|
System.out.printf("Max %d Threads, %d tasks per phaser\n", nthreads, tasksPerPhaser); |
69 |
|
|
|
70 |
|
|
for (int k = 2; k <= nthreads; k *= 2) { |
71 |
|
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
72 |
|
|
long startTime = System.nanoTime(); |
73 |
|
|
|
74 |
|
|
Runnable[] actions = new Runnable [k]; |
75 |
|
|
build(actions, size, 0, k, new Phaser()); |
76 |
|
|
Future[] futures = new Future[k]; |
77 |
|
|
for (int i = 0; i < k; ++i) { |
78 |
|
|
futures[i] = pool.submit(actions[i]); |
79 |
|
|
} |
80 |
|
|
for (int i = 0; i < k; ++i) { |
81 |
|
|
futures[i].get(); |
82 |
|
|
} |
83 |
|
|
long elapsed = System.nanoTime() - startTime; |
84 |
|
|
long bs = (NPS * size) / elapsed; |
85 |
|
|
System.out.printf("%4d Threads %8d iters: %11d barriers/sec\n", |
86 |
|
|
k, size, bs); |
87 |
|
|
} |
88 |
|
|
} |
89 |
|
|
pool.shutdown(); |
90 |
|
|
} |
91 |
|
|
|
92 |
|
|
} |
93 |
|
|
|
94 |
|
|
|