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.concurrent.*; |
11 |
|
* This version uses a simplified hardwired function. Inspired by a |
12 |
|
* <A href="http://www.cs.uga.edu/~dkl/filaments/dist.html"> |
13 |
|
* Filaments</A> demo program. |
14 |
– |
* |
14 |
|
*/ |
15 |
|
public final class Integrate { |
16 |
|
|
24 |
|
static int forkPolicy = DYNAMIC; |
25 |
|
static String forkArg = "dynamic"; |
26 |
|
|
27 |
< |
// the function to integrate |
28 |
< |
static double computeFunction(double x) { |
27 |
> |
/** the function to integrate */ |
28 |
> |
static double computeFunction(double x) { |
29 |
|
return (x * x + 1.0) * x; |
30 |
|
} |
31 |
|
|
32 |
|
static final double start = 0.0; |
33 |
|
static final double end = 1536.0; |
34 |
< |
/* |
34 |
> |
|
35 |
> |
/** |
36 |
|
* The number of recursive calls for |
37 |
|
* integrate from start to end. |
38 |
|
* (Empirically determined) |
63 |
|
} |
64 |
|
|
65 |
|
static void oneTest(int procs) { |
66 |
< |
ForkJoinPool g = procs == 0? new ForkJoinPool() : |
66 |
> |
ForkJoinPool g = (procs == 0) ? new ForkJoinPool() : |
67 |
|
new ForkJoinPool(procs); |
68 |
|
System.out.println("Number of procs=" + g.getParallelism()); |
69 |
|
System.out.println("Integrating from " + start + " to " + end + |
169 |
|
q.fork(); |
170 |
|
ar = recEval(c, r, fc, fr, ar); |
171 |
|
if (!q.tryUnfork()) { |
172 |
– |
// q.quietlyHelpJoin(); |
172 |
|
q.quietlyJoin(); |
173 |
|
return ar + q.area; |
174 |
|
} |
217 |
|
(q = new DQuad(l, c, al)).fork(); |
218 |
|
ar = recEval(c, r, fc, fr, ar); |
219 |
|
if (q != null && !q.tryUnfork()) { |
221 |
– |
// q.quietlyHelpJoin(); |
220 |
|
q.quietlyJoin(); |
221 |
|
return ar + q.area; |
222 |
|
} |
226 |
|
} |
227 |
|
|
228 |
|
} |
231 |
– |
|
232 |
– |
|