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