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