ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/test/extra166y/MapReduceDemo.java
(Generate patch)

Comparing jsr166/src/test/extra166y/MapReduceDemo.java (file contents):
Revision 1.2 by jsr166, Mon Nov 16 04:16:43 2009 UTC vs.
Revision 1.3 by dl, Thu Nov 25 12:38:35 2010 UTC

# Line 53 | Line 53 | public class MapReduceDemo {
53          Rand[] array = new Rand[n];
54          for (int i = 0; i < n; ++i)
55              array[i] = new Rand(i+1);
56 <        ForkJoinPool fjp = new ForkJoinPool(1);
56 >        ForkJoinPool fjp = new ForkJoinPool();
57          ParallelArray<Rand> pa = ParallelArray.createUsingHandoff(array, fjp);
58          final GetNext getNext = new GetNext();
59          final Accum accum = new Accum();
# Line 78 | Line 78 | public class MapReduceDemo {
78              for (int i = 2; i <= NCPU; i <<= 1) {
79                  resetSeeds(array, rseed);
80                  long sum = 0;
81 <                fjp.setParallelism(i);
81 >                //                fjp.setParallelism(i);
82                  last = System.nanoTime();
83                  for (int k = 0; k < reps; ++k) {
84                      sum += pa.withMapping(getNext).reduce(accum, zero);
# Line 89 | Line 89 | public class MapReduceDemo {
89                  now = System.nanoTime();
90                  elapsed = (double)(now - last) / NPS;
91                  last = now;
92 <                System.out.printf("poolSize %3d:  %7.3f\n", i, elapsed);
92 >                System.out.printf("poolSize %3d:  %7.3f\n", fjp.getParallelism(), elapsed);
93                  if (sum != seqsum) throw new Error("checksum");
94              }
95              for (int i = NCPU; i >= 1; i >>>= 1) {
96                  resetSeeds(array, rseed);
97                  long sum = 0;
98 <                fjp.setParallelism(i);
98 >                //                fjp.setParallelism(i);
99                  last = System.nanoTime();
100                  for (int k = 0; k < reps; ++k) {
101                      sum += pa.withMapping(getNext).reduce(accum, zero);
# Line 106 | Line 106 | public class MapReduceDemo {
106                  now = System.nanoTime();
107                  elapsed = (double)(now - last) / NPS;
108                  last = now;
109 <                System.out.printf("poolSize %3d:  %7.3f\n", i, elapsed);
109 >                System.out.printf("poolSize %3d:  %7.3f\n", fjp.getParallelism(), elapsed);
110                  if (sum != seqsum) throw new Error("checksum");
111              }
112          }

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines