test/loops/FJPhaserJacobi.java

/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/publicdomain/zero/1.0/
 */

import java.util.concurrent.*;

/** Barrier version of Jacobi iteration */
public class FJPhaserJacobi {

    static int dimGran;

    static final double EPSILON = 0.0001;  // convergence criterion

    public static void main(String[] args) {
        int n = 2048;
        int steps = 1000;
        try {
            if (args.length > 0)
                n = Integer.parseInt(args[0]);
            if (args.length > 1)
                steps = Integer.parseInt(args[1]);
        }

        catch (Exception e) {
            System.out.println("Usage: java ThreadPhaserJacobi <matrix size> <max steps>");
            return;
        }

        ForkJoinPool fjp = new ForkJoinPool();
        //        int granularity = (n * n / fjp.getParallelism()) / 2;
        int granularity = n * n / fjp.getParallelism();
        dimGran = (int)(Math.sqrt(granularity));

        // allocate enough space for edges
        int dim = n+2;
        int ncells = dim * dim;
        double[][] a = new double[dim][dim];
        double[][] b = new double[dim][dim];
        // Initialize interiors to small value
        double smallVal = 1.0/dim;
        for (int i = 1; i < dim-1; ++i) {
            for (int j = 1; j < dim-1; ++j)
                a[i][j] = smallVal;
        }
        int nreps = 3;
        for (int rep = 0; rep < nreps; ++rep) {
            // Fill all edges with 1's.
            for (int k = 0; k < dim; ++k) {
                a[k][0] += 1.0;
                a[k][n+1] += 1.0;
                a[0][k] += 1.0;
                a[n+1][k] += 1.0;
            }
            Driver driver = new Driver(a, b, 1, n, 1, n, steps);
            long startTime = System.currentTimeMillis();
            fjp.invoke(driver);

            long time = System.currentTimeMillis() - startTime;
            double secs = ((double)time) / 1000.0;

            System.out.println("Compute Time: " + secs);
            System.out.println(fjp);
        }
    }

    static class Segment extends CyclicAction {
        double[][] A; // matrix to get old values from
        double[][] B; // matrix to put new values into
        // indices of current submatrix
        final int loRow;
        final int hiRow;
        final int loCol;
        final int hiCol;
        volatile double maxDiff; // maximum difference between old and new values

        Segment(double[][] A, double[][] B,
                int loRow, int hiRow,
                int loCol, int hiCol,
                Phaser br) {
            super(br);
            this.A = A;   this.B = B;
            this.loRow = loRow; this.hiRow = hiRow;
            this.loCol = loCol; this.hiCol = hiCol;
        }

        public void step() {
            maxDiff = update(A, B);
            double[][] tmp = A; A = B; B = tmp;
        }

        double update(double[][] a, double[][] b) {
            double md = 0.0; // local for computing max diff

            for (int i = loRow; i <= hiRow; ++i) {
                for (int j = loCol; j <= hiCol; ++j) {
                    double v = 0.25 * (a[i-1][j] + a[i][j-1] +
                                       a[i+1][j] + a[i][j+1]);
                    b[i][j] = v;

                    double diff = v - a[i][j];
                    if (diff < 0) diff = -diff;
                    if (diff > md) md = diff;
                }
            }

            return md;
        }

    }

    static class MyPhaser extends Phaser {
        final int max;
        MyPhaser(int steps) { this.max = steps - 1; }
        public boolean onAdvance(int phase, int registeredParties) {
            return phase >= max || registeredParties <= 0;
        }
    }

    static class Driver extends RecursiveAction {
        double[][] A; // matrix to get old values from
        double[][] B; // matrix to put new values into
        final int loRow;   // indices of current submatrix
        final int hiRow;
        final int loCol;
        final int hiCol;
        final int steps;
        Driver(double[][] mat1, double[][] mat2,
               int firstRow, int lastRow,
               int firstCol, int lastCol,
               int steps) {

            this.A = mat1;   this.B = mat2;
            this.loRow = firstRow; this.hiRow = lastRow;
            this.loCol = firstCol; this.hiCol = lastCol;
            this.steps = steps;
        }

        public void compute() {
            int rows = hiRow - loRow + 1;
            int cols = hiCol - loCol + 1;
            int rblocks = Math.round((float)rows / dimGran);
            int cblocks = Math.round((float)cols / dimGran);

            int n = rblocks * cblocks;

            System.out.println("Using " + n + " segments");

            Segment[] segs = new Segment[n];
            Phaser barrier = new MyPhaser(steps);
            int k = 0;
            for (int i = 0; i < rblocks; ++i) {
                int lr = loRow + i * dimGran;
                int hr = lr + dimGran;
                if (i == rblocks-1) hr = hiRow;

                for (int j = 0; j < cblocks; ++j) {
                    int lc = loCol + j * dimGran;
                    int hc = lc + dimGran;
                    if (j == cblocks-1) hc = hiCol;

                    segs[k] = new Segment(A, B, lr, hr, lc, hc, barrier);
                    ++k;
                }
            }
            invokeAll(segs);
            double maxd = 0;
            for (k = 0; k < n; ++k) {
                double md = segs[k].maxDiff;
                if (md > maxd) maxd = md;
            }
            System.out.println("Max diff after " + steps + " steps = " + maxd);
        }
    }
}
Revision:	1.12
Committed:	Mon Aug 10 03:13:33 2015 UTC (8 years, 8 months ago) by jsr166
Branch:	MAIN
Changes since 1.11:	+0 -2 lines
Log Message:	delete unwanted blank lines
#	User	Rev	Content
1	jsr166	1.10	/*
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/publicdomain/zero/1.0/
5			*/
6	dl	1.1
7			import java.util.concurrent.*;
8
9	jsr166	1.10	/** Barrier version of Jacobi iteration */
10	dl	1.1	public class FJPhaserJacobi {
11
12			static int dimGran;
13
14			static final double EPSILON = 0.0001; // convergence criterion
15
16			public static void main(String[] args) {
17			int n = 2048;
18			int steps = 1000;
19			try {
20			if (args.length > 0)
21			n = Integer.parseInt(args[0]);
22			if (args.length > 1)
23			steps = Integer.parseInt(args[1]);
24			}
25	jsr166	1.8
26	dl	1.1	catch (Exception e) {
27	dl	1.7	System.out.println("Usage: java ThreadPhaserJacobi <matrix size> <max steps>");
28	dl	1.1	return;
29			}
30	jsr166	1.8
31	dl	1.1	ForkJoinPool fjp = new ForkJoinPool();
32	dl	1.7	// int granularity = (n * n / fjp.getParallelism()) / 2;
33	dl	1.1	int granularity = n * n / fjp.getParallelism();
34	dl	1.7	dimGran = (int)(Math.sqrt(granularity));
35	jsr166	1.8
36	dl	1.1	// allocate enough space for edges
37			int dim = n+2;
38			int ncells = dim * dim;
39			double[][] a = new double[dim][dim];
40			double[][] b = new double[dim][dim];
41			// Initialize interiors to small value
42	jsr166	1.8	double smallVal = 1.0/dim;
43	dl	1.1	for (int i = 1; i < dim-1; ++i) {
44			for (int j = 1; j < dim-1; ++j)
45			a[i][j] = smallVal;
46			}
47			int nreps = 3;
48			for (int rep = 0; rep < nreps; ++rep) {
49			// Fill all edges with 1's.
50			for (int k = 0; k < dim; ++k) {
51			a[k][0] += 1.0;
52			a[k][n+1] += 1.0;
53			a[0][k] += 1.0;
54			a[n+1][k] += 1.0;
55			}
56			Driver driver = new Driver(a, b, 1, n, 1, n, steps);
57			long startTime = System.currentTimeMillis();
58			fjp.invoke(driver);
59	jsr166	1.8
60	dl	1.1	long time = System.currentTimeMillis() - startTime;
61	dl	1.7	double secs = ((double)time) / 1000.0;
62	jsr166	1.8
63	dl	1.1	System.out.println("Compute Time: " + secs);
64			System.out.println(fjp);
65			}
66			}
67
68			static class Segment extends CyclicAction {
69			double[][] A; // matrix to get old values from
70			double[][] B; // matrix to put new values into
71			// indices of current submatrix
72	jsr166	1.8	final int loRow;
73	dl	1.1	final int hiRow;
74			final int loCol;
75			final int hiCol;
76			volatile double maxDiff; // maximum difference between old and new values
77
78	jsr166	1.8	Segment(double[][] A, double[][] B,
79	dl	1.1	int loRow, int hiRow,
80	jsr166	1.8	int loCol, int hiCol,
81	dl	1.1	Phaser br) {
82			super(br);
83			this.A = A; this.B = B;
84			this.loRow = loRow; this.hiRow = hiRow;
85			this.loCol = loCol; this.hiCol = hiCol;
86			}
87
88			public void step() {
89			maxDiff = update(A, B);
90			double[][] tmp = A; A = B; B = tmp;
91			}
92
93			double update(double[][] a, double[][] b) {
94			double md = 0.0; // local for computing max diff
95
96			for (int i = loRow; i <= hiRow; ++i) {
97			for (int j = loCol; j <= hiCol; ++j) {
98			double v = 0.25 * (a[i-1][j] + a[i][j-1] +
99			a[i+1][j] + a[i][j+1]);
100			b[i][j] = v;
101
102			double diff = v - a[i][j];
103			if (diff < 0) diff = -diff;
104			if (diff > md) md = diff;
105			}
106			}
107
108			return md;
109			}
110	jsr166	1.8
111	dl	1.1	}
112
113			static class MyPhaser extends Phaser {
114			final int max;
115			MyPhaser(int steps) { this.max = steps - 1; }
116			public boolean onAdvance(int phase, int registeredParties) {
117			return phase >= max \|\| registeredParties <= 0;
118			}
119			}
120
121	jsr166	1.8	static class Driver extends RecursiveAction {
122	dl	1.1	double[][] A; // matrix to get old values from
123			double[][] B; // matrix to put new values into
124			final int loRow; // indices of current submatrix
125			final int hiRow;
126			final int loCol;
127			final int hiCol;
128			final int steps;
129	jsr166	1.8	Driver(double[][] mat1, double[][] mat2,
130	dl	1.1	int firstRow, int lastRow,
131			int firstCol, int lastCol,
132			int steps) {
133	jsr166	1.8
134	dl	1.1	this.A = mat1; this.B = mat2;
135			this.loRow = firstRow; this.hiRow = lastRow;
136			this.loCol = firstCol; this.hiCol = lastCol;
137			this.steps = steps;
138			}
139
140			public void compute() {
141			int rows = hiRow - loRow + 1;
142			int cols = hiCol - loCol + 1;
143	jsr166	1.11	int rblocks = Math.round((float)rows / dimGran);
144			int cblocks = Math.round((float)cols / dimGran);
145	jsr166	1.8
146	dl	1.1	int n = rblocks * cblocks;
147	jsr166	1.8
148	dl	1.1	System.out.println("Using " + n + " segments");
149	jsr166	1.8
150	dl	1.1	Segment[] segs = new Segment[n];
151			Phaser barrier = new MyPhaser(steps);
152			int k = 0;
153			for (int i = 0; i < rblocks; ++i) {
154			int lr = loRow + i * dimGran;
155			int hr = lr + dimGran;
156			if (i == rblocks-1) hr = hiRow;
157	jsr166	1.8
158	dl	1.1	for (int j = 0; j < cblocks; ++j) {
159			int lc = loCol + j * dimGran;
160			int hc = lc + dimGran;
161			if (j == cblocks-1) hc = hiCol;
162	jsr166	1.8
163	dl	1.1	segs[k] = new Segment(A, B, lr, hr, lc, hc, barrier);
164			++k;
165			}
166			}
167			invokeAll(segs);
168			double maxd = 0;
169			for (k = 0; k < n; ++k) {
170			double md = segs[k].maxDiff;
171			if (md > maxd) maxd = md;
172			}
173			System.out.println("Max diff after " + steps + " steps = " + maxd);
174			}
175			}
176			}