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 jsr166y.*; |
7 |
|
import java.util.concurrent.*; |
8 |
|
|
9 |
|
/** |
10 |
< |
* Sample program using Gaussian Quadrature for numerical integration. |
10 |
> |
* Sample program using Guassian Quadrature for numerical integration. |
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 |
+ |
* |
15 |
|
*/ |
16 |
|
public final class Integrate { |
17 |
|
|
26 |
|
static String forkArg = "dynamic"; |
27 |
|
|
28 |
|
// the function to integrate |
29 |
< |
static double computeFunction(double x) { |
29 |
> |
static double computeFunction(double x) { |
30 |
|
return (x * x + 1.0) * x; |
31 |
|
} |
32 |
|
|
40 |
|
static final int calls = 263479047; |
41 |
|
|
42 |
|
public static void main(String[] args) throws Exception { |
43 |
< |
int procs = Runtime.getRuntime().availableProcessors(); |
43 |
> |
int procs = 0; |
44 |
|
|
45 |
|
try { |
46 |
|
if (args.length > 0) |
54 |
|
} |
55 |
|
} |
56 |
|
catch (Exception e) { |
57 |
< |
System.out.println("Usage: java Integrate threads <s[erial] | d[ynamic] | f[ork] - default d>"); |
57 |
> |
System.out.println("Usage: java Integrate3 threads <s[erial] | d[ynamic] | f[ork] - default d>"); |
58 |
|
return; |
59 |
|
} |
60 |
+ |
oneTest(procs); |
61 |
+ |
oneTest(procs); |
62 |
+ |
oneTest(procs); |
63 |
+ |
} |
64 |
|
|
65 |
< |
ForkJoinPool g = new ForkJoinPool(procs); |
65 |
> |
static void oneTest(int procs) { |
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 + |
70 |
|
" forkPolicy = " + forkArg); |
71 |
|
long lastTime = System.nanoTime(); |
72 |
< |
for (int i = 0; i < 10; ++i) { |
72 |
> |
for (int i = 0; i < 20; ++i) { |
73 |
|
double a; |
74 |
|
if (forkPolicy == SERIAL) |
75 |
|
a = SQuad.computeArea(g, start, end); |
82 |
|
lastTime = now; |
83 |
|
System.out.printf("Calls/sec: %12d", (long) (calls / s)); |
84 |
|
System.out.printf(" Time: %7.3f", s); |
85 |
< |
System.out.printf(" Area: %12.1f", a); |
85 |
> |
System.out.printf(" Threads: %5d", g.getPoolSize()); |
86 |
> |
// System.out.printf(" Area: %12.1f", a); |
87 |
|
System.out.println(); |
88 |
|
} |
89 |
|
System.out.println(g); |
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 |
|
} |
175 |
|
return ar + recEval(l, c, fl, fc, al); |
217 |
|
(q = new DQuad(l, c, al)).fork(); |
218 |
|
ar = recEval(c, r, fc, fr, ar); |
219 |
|
if (q != null && !q.tryUnfork()) { |
220 |
< |
q.quietlyHelpJoin(); |
220 |
> |
q.quietlyJoin(); |
221 |
|
return ar + q.area; |
222 |
|
} |
223 |
|
return ar + recEval(l, c, fl, fc, al); |
226 |
|
} |
227 |
|
|
228 |
|
} |
229 |
+ |
|
230 |
+ |
|