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(); |
32 |
|
actions[i] = new PhaserAction(i, b, sz); |
33 |
|
} |
34 |
|
} |
36 |
– |
|
35 |
|
|
36 |
|
static final class PhaserAction implements Runnable { |
37 |
|
final int id; |
44 |
|
phaser.register(); |
45 |
|
} |
46 |
|
|
49 |
– |
|
47 |
|
public void run() { |
48 |
|
int n = size; |
49 |
|
Phaser b = phaser; |
67 |
|
|
68 |
|
Runnable[] actions = new Runnable [k]; |
69 |
|
build(actions, size, 0, k, new Phaser()); |
70 |
< |
Future[] futures = new Future[k]; |
70 |
> |
Future<?>[] futures = new Future<?>[k]; |
71 |
|
for (int i = 0; i < k; ++i) { |
72 |
|
futures[i] = pool.submit(actions[i]); |
73 |
|
} |