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.*; |
12 |
|
// Performance-tuning constant: |
13 |
|
static int sequentialThreshold; |
14 |
|
static long lastStealCount; |
15 |
< |
|
15 |
> |
|
16 |
|
public static void main(String[] args) throws Exception { |
17 |
|
int procs = 0; |
18 |
|
int num = 45; |
22 |
|
procs = Integer.parseInt(args[0]); |
23 |
|
if (args.length > 1) |
24 |
|
num = Integer.parseInt(args[1]); |
25 |
< |
if (args.length > 2) |
25 |
> |
if (args.length > 2) |
26 |
|
sequentialThreshold = Integer.parseInt(args[2]); |
27 |
|
} |
28 |
|
catch (Exception e) { |
30 |
|
return; |
31 |
|
} |
32 |
|
|
28 |
– |
|
33 |
|
for (int reps = 0; reps < 2; ++reps) { |
34 |
< |
ForkJoinPool g = procs == 0? new ForkJoinPool() : |
34 |
> |
ForkJoinPool g = (procs == 0) ? ForkJoinPool.commonPool() : |
35 |
|
new ForkJoinPool(procs); |
32 |
– |
// g.setMaintainsParallelism(false); |
36 |
|
lastStealCount = g.getStealCount(); |
37 |
|
for (int i = 0; i < 20; ++i) { |
38 |
|
test(g, num); |
39 |
< |
Thread.sleep(50); |
39 |
> |
Thread.sleep(100); |
40 |
|
} |
41 |
|
System.out.println(g); |
42 |
< |
g.shutdown(); |
43 |
< |
if (!g.awaitTermination(8, TimeUnit.SECONDS)) { |
41 |
< |
System.out.println(g); |
42 |
< |
throw new Error(); |
43 |
< |
} |
44 |
< |
g = null; |
45 |
< |
// System.gc(); |
42 |
> |
if (g != ForkJoinPool.commonPool()) |
43 |
> |
g.shutdown(); |
44 |
|
Thread.sleep(500); |
45 |
|
} |
46 |
|
} |
64 |
|
System.out.println(); |
65 |
|
} |
66 |
|
|
69 |
– |
|
67 |
|
// Initialized with argument; replaced with result |
68 |
|
int number; |
69 |
|
LeftSpineFib next; |
118 |
|
} |
119 |
|
|
120 |
|
} |
124 |
– |
|