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 TieredPhaserLoops { |
15 |
|
static final int NCPUS = Runtime.getRuntime().availableProcessors(); |
16 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
20 |
|
static final long NPS = (1000L * 1000 * 1000); |
21 |
|
|
22 |
|
static int tasksPerPhaser = Math.max(NCPUS / 8, 4); |
23 |
< |
|
23 |
> |
|
24 |
|
static void build(Runnable[] actions, int sz, int lo, int hi, Phaser b) { |
25 |
< |
int step = (hi - lo) / tasksPerPhaser; |
26 |
< |
if (step > 1) { |
27 |
< |
int i = lo; |
28 |
< |
while (i < hi) { |
30 |
< |
int r = Math.min(i + step, hi); |
31 |
< |
build(actions, sz, i, r, new Phaser(b)); |
32 |
< |
i = r; |
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 |
< |
} |
31 |
< |
else { |
36 |
< |
for (int i = lo; i < hi; ++i) |
30 |
> |
} else { |
31 |
> |
for (int i = lo; i < hi; ++i) |
32 |
|
actions[i] = new PhaserAction(i, b, sz); |
33 |
|
} |
34 |
|
} |
35 |
|
|
36 |
+ |
|
37 |
|
static final class PhaserAction implements Runnable { |
38 |
|
final int id; |
39 |
|
final int size; |
49 |
|
public void run() { |
50 |
|
int n = size; |
51 |
|
Phaser b = phaser; |
52 |
< |
for(int i = 0; i < n; ++i) |
52 |
> |
for (int i = 0; i < n; ++i) |
53 |
|
b.arriveAndAwaitAdvance(); |
54 |
|
} |
55 |
|
} |
60 |
|
nthreads = Integer.parseInt(args[0]); |
61 |
|
if (args.length > 1) |
62 |
|
tasksPerPhaser = Integer.parseInt(args[1]); |
63 |
< |
|
63 |
> |
|
64 |
|
System.out.printf("Max %d Threads, %d tasks per phaser\n", nthreads, tasksPerPhaser); |
65 |
|
|
66 |
|
for (int k = 2; k <= nthreads; k *= 2) { |
67 |
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
68 |
|
long startTime = System.nanoTime(); |
69 |
< |
|
69 |
> |
|
70 |
|
Runnable[] actions = new Runnable [k]; |
71 |
|
build(actions, size, 0, k, new Phaser()); |
72 |
< |
Future[] futures = new Future[k]; |
72 |
> |
Future<?>[] futures = new Future<?>[k]; |
73 |
|
for (int i = 0; i < k; ++i) { |
74 |
|
futures[i] = pool.submit(actions[i]); |
75 |
|
} |
84 |
|
} |
85 |
|
pool.shutdown(); |
86 |
|
} |
91 |
– |
|
92 |
– |
} |
93 |
– |
|
87 |
|
|
88 |
+ |
} |