| 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.*; |
| 33 |
|
public void compute() { |
| 34 |
|
int n = size; |
| 35 |
|
Phaser b = phaser; |
| 36 |
< |
for(int i = 0; i < n; ++i) |
| 36 |
> |
for (int i = 0; i < n; ++i) |
| 37 |
|
b.arriveAndAwaitAdvance(); |
| 38 |
|
} |
| 39 |
|
} |
| 50 |
|
|
| 51 |
|
for (int size = FIRST_SIZE; size <= LAST_SIZE; size *= 10) { |
| 52 |
|
long startTime = System.nanoTime(); |
| 53 |
< |
|
| 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 |
< |
|
| 59 |
> |
|
| 60 |
|
pool.invoke(new RecursiveAction() { |
| 61 |
|
public void compute() { invokeAll(actions); }}); |
| 62 |
< |
|
| 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", |
| 68 |
|
pool.shutdown(); |
| 69 |
|
} |
| 70 |
|
} |
| 71 |
– |
|
| 72 |
– |
} |
| 73 |
– |
|
| 71 |
|
|
| 72 |
+ |
} |
