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 |
< |
/* |
35 |
< |
* The number of recursive calls for |
34 |
> |
|
35 |
> |
/** |
36 |
> |
* The number of recursive calls for |
37 |
|
* integrate from start to end. |
38 |
|
* (Empirically determined) |
39 |
|
*/ |
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 + |
69 |
> |
System.out.println("Integrating from " + start + " to " + end + |
70 |
|
" forkPolicy = " + forkArg); |
71 |
|
long lastTime = System.nanoTime(); |
72 |
|
for (int i = 0; i < 20; ++i) { |
73 |
|
double a; |
74 |
|
if (forkPolicy == SERIAL) |
75 |
|
a = SQuad.computeArea(g, start, end); |
76 |
< |
else if (forkPolicy == FORK) |
76 |
> |
else if (forkPolicy == FORK) |
77 |
|
a = FQuad.computeArea(g, start, end); |
78 |
|
else |
79 |
|
a = DQuad.computeArea(g, start, end); |
90 |
|
g.shutdown(); |
91 |
|
} |
92 |
|
|
93 |
– |
|
93 |
|
// Sequential version |
94 |
|
static final class SQuad extends RecursiveAction { |
95 |
|
static double computeArea(ForkJoinPool pool, double l, double r) { |
101 |
|
final double left; // lower bound |
102 |
|
final double right; // upper bound |
103 |
|
double area; |
104 |
< |
|
104 |
> |
|
105 |
|
SQuad(double l, double r, double a) { |
106 |
|
this.left = l; this.right = r; this.area = a; |
107 |
|
} |
108 |
< |
|
108 |
> |
|
109 |
|
public final void compute() { |
110 |
|
double l = left; |
111 |
|
double r = right; |
112 |
|
area = recEval(l, r, (l * l + 1.0) * l, (r * r + 1.0) * r, area); |
113 |
|
} |
114 |
< |
|
114 |
> |
|
115 |
|
static final double recEval(double l, double r, double fl, |
116 |
|
double fr, double a) { |
117 |
|
double h = (r - l) * 0.5; |
118 |
|
double c = l + h; |
119 |
< |
double fc = (c * c + 1.0) * c; |
119 |
> |
double fc = (c * c + 1.0) * c; |
120 |
|
double hh = h * 0.5; |
121 |
< |
double al = (fl + fc) * hh; |
121 |
> |
double al = (fl + fc) * hh; |
122 |
|
double ar = (fr + fc) * hh; |
123 |
|
double alr = al + ar; |
124 |
|
if (Math.abs(alr - a) <= errorTolerance) |
142 |
|
final double left; // lower bound |
143 |
|
final double right; // upper bound |
144 |
|
double area; |
145 |
< |
|
145 |
> |
|
146 |
|
FQuad(double l, double r, double a) { |
147 |
|
this.left = l; this.right = r; this.area = a; |
148 |
|
} |
149 |
< |
|
149 |
> |
|
150 |
|
public final void compute() { |
151 |
|
double l = left; |
152 |
|
double r = right; |
153 |
|
area = recEval(l, r, (l * l + 1.0) * l, (r * r + 1.0) * r, area); |
154 |
|
} |
155 |
< |
|
155 |
> |
|
156 |
|
static final double recEval(double l, double r, double fl, |
157 |
|
double fr, double a) { |
158 |
|
double h = (r - l) * 0.5; |
159 |
|
double c = l + h; |
160 |
< |
double fc = (c * c + 1.0) * c; |
160 |
> |
double fc = (c * c + 1.0) * c; |
161 |
|
double hh = h * 0.5; |
162 |
< |
double al = (fl + fc) * hh; |
162 |
> |
double al = (fl + fc) * hh; |
163 |
|
double ar = (fr + fc) * hh; |
164 |
|
double alr = al + ar; |
165 |
|
if (Math.abs(alr - a) <= errorTolerance) |
168 |
|
q.fork(); |
169 |
|
ar = recEval(c, r, fc, fr, ar); |
170 |
|
if (!q.tryUnfork()) { |
172 |
– |
// q.quietlyHelpJoin(); |
171 |
|
q.quietlyJoin(); |
172 |
|
return ar + q.area; |
173 |
|
} |
178 |
|
|
179 |
|
// ........................... |
180 |
|
|
181 |
< |
// Version using on-demand Fork |
181 |
> |
// Version using on-demand Fork |
182 |
|
static final class DQuad extends RecursiveAction { |
183 |
|
static double computeArea(ForkJoinPool pool, double l, double r) { |
184 |
|
DQuad q = new DQuad(l, r, 0); |
189 |
|
final double left; // lower bound |
190 |
|
final double right; // upper bound |
191 |
|
double area; |
192 |
< |
|
192 |
> |
|
193 |
|
DQuad(double l, double r, double a) { |
194 |
|
this.left = l; this.right = r; this.area = a; |
195 |
|
} |
196 |
< |
|
196 |
> |
|
197 |
|
public final void compute() { |
198 |
|
double l = left; |
199 |
|
double r = right; |
200 |
|
area = recEval(l, r, (l * l + 1.0) * l, (r * r + 1.0) * r, area); |
201 |
|
} |
202 |
< |
|
202 |
> |
|
203 |
|
static final double recEval(double l, double r, double fl, |
204 |
|
double fr, double a) { |
205 |
|
double h = (r - l) * 0.5; |
206 |
|
double c = l + h; |
207 |
< |
double fc = (c * c + 1.0) * c; |
207 |
> |
double fc = (c * c + 1.0) * c; |
208 |
|
double hh = h * 0.5; |
209 |
< |
double al = (fl + fc) * hh; |
209 |
> |
double al = (fl + fc) * hh; |
210 |
|
double ar = (fr + fc) * hh; |
211 |
|
double alr = al + ar; |
212 |
|
if (Math.abs(alr - a) <= errorTolerance) |
216 |
|
(q = new DQuad(l, c, al)).fork(); |
217 |
|
ar = recEval(c, r, fc, fr, ar); |
218 |
|
if (q != null && !q.tryUnfork()) { |
221 |
– |
// q.quietlyHelpJoin(); |
219 |
|
q.quietlyJoin(); |
220 |
|
return ar + q.area; |
221 |
|
} |
225 |
|
} |
226 |
|
|
227 |
|
} |
231 |
– |
|
232 |
– |
|