Difference between revisions of "Iterative Averaging"
Jump to navigation
Jump to search
Line 7: | Line 7: | ||
[http://www.baeldung.com/java-phaser Guide to the Java Phaser] | [http://www.baeldung.com/java-phaser Guide to the Java Phaser] | ||
− | = | + | {{warning | Our use of the forall loop with Phasers does not accurately convey their finicky nature. More than other features, Phasers seem to require more care to get performance improvements. }} |
− | {{ | + | |
+ | =Code to Investigate= | ||
+ | {{CodeToInvestigate|SequentialIterativeAverager|iterativelyAverage|iterativeaveraging.studio}} | ||
+ | |||
+ | {{Sequential|public void iterativelyAverage(List<Slice<double[]>> slices, double[] a, double[] b, int iterationCount)}} | ||
+ | |||
+ | <nowiki> for (int iteration = 0; iteration < iterationCount; iteration++) { | ||
+ | double[] arrayPrev = ((iteration & 1) == 0) ? a : b; | ||
+ | double[] arrayNext = ((iteration & 1) == 0) ? b : a; | ||
+ | for (Slice<double[]> slice : slices) { | ||
+ | for (int index = slice.getMinInclusive(); index < slice.getMaxExclusive(); index++) { | ||
+ | arrayNext[index] = (arrayPrev[index - 1] + arrayPrev[index + 1]) * 0.5; | ||
+ | } | ||
+ | } | ||
+ | }</nowiki> | ||
+ | |||
=Code to Implement= | =Code to Implement= |
Revision as of 20:57, 5 March 2018
Contents
Motivation
X10/Habanero like Phasers have been added to Java since JDK7. We will gain some experience with using Phasers in a parallel for loop context.
Background
Warning: Our use of the forall loop with Phasers does not accurately convey their finicky nature. More than other features, Phasers seem to require more care to get performance improvements. |
Code to Investigate
class: | SequentialIterativeAverager.java | DEMO: |
methods: | iterativelyAverage | |
package: | iterativeaveraging.studio | |
source folder: | src//java |
method: public void iterativelyAverage(List<Slice<double[]>> slices, double[] a, double[] b, int iterationCount)
(sequential implementation only)
for (int iteration = 0; iteration < iterationCount; iteration++) { double[] arrayPrev = ((iteration & 1) == 0) ? a : b; double[] arrayNext = ((iteration & 1) == 0) ? b : a; for (Slice<double[]> slice : slices) { for (int index = slice.getMinInclusive(); index < slice.getMaxExclusive(); index++) { arrayNext[index] = (arrayPrev[index - 1] + arrayPrev[index + 1]) * 0.5; } } }
Code to Implement
class: | ForForallIterativeAverager.java | |
methods: | iterativelyAverage | |
package: | iterativeaveraging.studio | |
source folder: | student/src/main/java |
method: public void iterativelyAverage(List<Slice<double[]>> slices, double[] a, double[] b, int iterationCount)
(parallel implementation required)
class: | ForallForPhasedIterativeAverager.java | |
methods: | iterativelyAverage | |
package: | iterativeaveraging.studio | |
source folder: | student/src/main/java |
method: public void iterativelyAverage(List<Slice<double[]>> slices, double[] a, double[] b, int iterationCount)
(parallel implementation required)
Testing Your Solution
Correctness
class: | IterativeAveragingTestSuite.java | |
package: | iterativeaveraging.studio | |
source folder: | testing/src/test/java |
Performance
class: | IterativeAveragingTiming.java | |
package: | iterativeaveraging.studio | |
source folder: | src/main/java |