19 |
|
}; // see http://www.durangobill.com/N_Queens.html |
20 |
|
|
21 |
|
static final int FIRST_SIZE = 8; // smaller ones too short to measure well |
22 |
< |
static final int LAST_SIZE = 15; // bigger ones too long to wait for |
22 |
> |
static final int LAST_SIZE = 16; // bigger ones too long to wait for |
23 |
|
|
24 |
|
/** for time conversion */ |
25 |
|
static final long NPS = (1000L * 1000 * 1000); |
35 |
|
return; |
36 |
|
} |
37 |
|
for (int reps = 0; reps < 2; ++reps) { |
38 |
< |
ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
38 |
> |
ForkJoinPool g = (procs == 0) ? ForkJoinPool.commonPool() : |
39 |
|
new ForkJoinPool(procs); |
40 |
|
lastStealCount = g.getStealCount(); |
41 |
|
for (int i = FIRST_SIZE; i <= LAST_SIZE; i++) |
42 |
|
test(g, i); |
43 |
|
System.out.println(g); |
44 |
< |
g.shutdown(); |
44 |
> |
if (g != ForkJoinPool.commonPool()) |
45 |
> |
g.shutdown(); |
46 |
> |
Thread.sleep(100); |
47 |
|
} |
48 |
|
} |
49 |
|
|
113 |
|
s.compute(); |
114 |
|
int ns = s.solutions; |
115 |
|
s = s.nextSubtask; |
116 |
+ |
/* comment out to stress join |
117 |
|
// Then the unstolen ones |
118 |
|
while (s != null && s.tryUnfork()) { |
119 |
|
s.compute(); |
120 |
|
ns += s.solutions; |
121 |
|
s = s.nextSubtask; |
122 |
|
} |
123 |
+ |
*/ |
124 |
|
// Then wait for the stolen ones |
125 |
|
while (s != null) { |
126 |
|
s.join(); |