File: MandelbrotSetSmp3.java

package info (click to toggle)
libpj-java 0.0~20150107%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 13,396 kB
  • sloc: java: 99,543; ansic: 987; sh: 153; xml: 26; makefile: 10; sed: 4
file content (380 lines) | stat: -rw-r--r-- 12,830 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
//******************************************************************************
//
// File:    MandelbrotSetSmp3.java
// Package: edu.rit.smp.fractal
// Unit:    Class edu.rit.smp.fractal.MandelbrotSetSmp3
//
// This Java source file is copyright (C) 2007 by Alan Kaminsky. All rights
// reserved. For further information, contact the author, Alan Kaminsky, at
// ark@cs.rit.edu.
//
// This Java source file is part of the Parallel Java Library ("PJ"). PJ is free
// software; you can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// PJ is distributed in the hope that it will be useful, but WITHOUT ANY
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
// A PARTICULAR PURPOSE. See the GNU General Public License for more details.
//
// Linking this library statically or dynamically with other modules is making a
// combined work based on this library. Thus, the terms and conditions of the
// GNU General Public License cover the whole combination.
//
// As a special exception, the copyright holders of this library give you
// permission to link this library with independent modules to produce an
// executable, regardless of the license terms of these independent modules, and
// to copy and distribute the resulting executable under terms of your choice,
// provided that you also meet, for each linked independent module, the terms
// and conditions of the license of that module. An independent module is a
// module which is not derived from or based on this library. If you modify this
// library, you may extend this exception to your version of the library, but
// you are not obligated to do so. If you do not wish to do so, delete this
// exception statement from your version.
//
// A copy of the GNU General Public License is provided in the file gpl.txt. You
// may also obtain a copy of the GNU General Public License on the World Wide
// Web at http://www.gnu.org/licenses/gpl.html.
//
//******************************************************************************

package edu.rit.smp.fractal;

import edu.rit.color.HSB;

import edu.rit.image.PJGColorImage;
import edu.rit.image.PJGImage;

import edu.rit.pj.BarrierAction;
import edu.rit.pj.IntegerForLoop;
import edu.rit.pj.IntegerSchedule;
import edu.rit.pj.ParallelRegion;
import edu.rit.pj.ParallelSection;
import edu.rit.pj.ParallelTeam;

import edu.rit.util.Range;

import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileOutputStream;

import java.util.ArrayList;

import java.util.concurrent.LinkedBlockingQueue;

/**
 * Class MandelbrotSetSmp3 is an SMP parallel program that calculates the
 * Mandelbrot Set.
 * <P>
 * Usage: java -Dpj.nt=<I>K</I> -Dpj.schedule=<I>schedule</I>
 * edu.rit.smp.fractal.MandelbrotSetSmp3 <I>width</I> <I>height</I>
 * <I>xcenter</I> <I>ycenter</I> <I>resolution</I> <I>maxiter</I> <I>gamma</I>
 * <I>filename</I>
 * <BR><I>K</I> = Number of computation processors
 * <BR><I>schedule</I> = Parallel loop schedule
 * <BR><I>width</I> = Image width (pixels)
 * <BR><I>height</I> = Image height (pixels)
 * <BR><I>xcenter</I> = X coordinate of center point
 * <BR><I>ycenter</I> = Y coordinate of center point
 * <BR><I>resolution</I> = Pixels per unit
 * <BR><I>maxiter</I> = Maximum number of iterations
 * <BR><I>gamma</I> = Used to calculate pixel hues
 * <BR><I>filename</I> = PJG image file name
 * <P>
 * The program considers a rectangular region of the complex plane centered at
 * (<I>xcenter,ycenter</I>) of <I>width</I> pixels by <I>height</I> pixels,
 * where the distance between adjacent pixels is 1/<I>resolution</I>. The
 * program takes each pixel's location as a complex number <I>c</I> and performs
 * the following iteration:
 * <P>
 * <I>z</I><SUB>0</SUB> = 0
 * <BR><I>z</I><SUB><I>i</I>+1</SUB> = <I>z</I><SUB><I>i</I></SUB><SUP>2</SUP> + <I>c</I>
 * <P>
 * until <I>z</I><SUB><I>i</I></SUB>'s magnitude becomes greater than or equal
 * to 2, or <I>i</I> reaches a limit of <I>maxiter</I>. The complex numbers
 * <I>c</I> where <I>i</I> reaches a limit of <I>maxiter</I> are considered to
 * be in the Mandelbrot Set. (Actually, a number is in the Mandelbrot Set only
 * if the iteration would continue forever without <I>z</I><SUB><I>i</I></SUB>
 * becoming infinite; the foregoing is just an approximation.) The program
 * creates an image with the pixels corresponding to the complex numbers
 * <I>c</I> and the pixels' colors corresponding to the value of <I>i</I>
 * achieved by the iteration. Following the traditional practice, points in the
 * Mandelbrot set are black, and the other points are brightly colored in a
 * range of colors depending on <I>i</I>. The exact hue of each pixel is
 * (<I>i</I>/<I>maxiter</I>)<SUP><I>gamma</I></SUP>. The image is stored in a
 * Parallel Java Graphics (PJG) file specified on the command line.
 * <P>
 * The computation is performed in parallel in multiple processors. A separate
 * thread writes the output image file concurrently with the threads computing
 * the image (overlapped computation and I/O). The program uses <I>K</I>+1
 * threads -- <I>K</I> computation threads plus one I/O thread. The program
 * measures the computation's running time, including the time to write the
 * image file. The program also measures the running time for each parallel team
 * thread.
 *
 * @author  Alan Kaminsky
 * @version 11-Nov-2007
 */
public class MandelbrotSetSmp3
	{

// Prevent construction.

	private MandelbrotSetSmp3()
		{
		}

// Program shared variables.

	// Command line arguments.
	static int width;
	static int height;
	static double xcenter;
	static double ycenter;
	static double resolution;
	static int maxiter;
	static double gamma;
	static File filename;

	// Initial pixel offsets from center.
	static int xoffset;
	static int yoffset;

	// Image matrix.
	static int[][] matrix;
	static PJGColorImage image;

	// Table of hues.
	static int[] huetable;

	// Queue for synchronizing computation threads and I/O threads.
	static LinkedBlockingQueue<Range> queue;

	// Parallel sections for computation and for I/O.
	static ParallelSection computationSection;
	static ParallelSection ioSection;

	// Starting and ending times for each computation thread and for the I/O
	// thread.
	static long[] comp_thr_t1;
	static long[] comp_thr_t2;
	static long io_thr_t1;
	static long io_thr_t2;

	// Starting and ending times for each chunk of indexes in each thread.
	static ArrayList<Long>[] chunk_t1;
	static ArrayList<Long>[] chunk_t2;

// Main program.

	/**
	 * Mandelbrot Set main program.
	 */
	public static void main
		(String[] args)
		throws Exception
		{
		//Comm.init (args);

		// Start timing.
		long t1 = System.currentTimeMillis();

		// Validate command line arguments.
		if (args.length != 8) usage();
		width = Integer.parseInt (args[0]);
		height = Integer.parseInt (args[1]);
		xcenter = Double.parseDouble (args[2]);
		ycenter = Double.parseDouble (args[3]);
		resolution = Double.parseDouble (args[4]);
		maxiter = Integer.parseInt (args[5]);
		gamma = Double.parseDouble (args[6]);
		filename = new File (args[7]);

		// Initial pixel offsets from center.
		xoffset = -(width - 1) / 2;
		yoffset = (height - 1) / 2;

		// Create image matrix to store results.
		matrix = new int [height] [width];
		image = new PJGColorImage (height, width, matrix);

		// Create table of hues for different iteration counts.
		huetable = new int [maxiter+1];
		for (int i = 0; i < maxiter; ++ i)
			{
			huetable[i] = HSB.pack
				(/*hue*/ (float) Math.pow (((double)i)/((double)maxiter),gamma),
				 /*sat*/ 1.0f,
				 /*bri*/ 1.0f);
			}
		huetable[maxiter] = HSB.pack (1.0f, 1.0f, 0.0f);

		// Set up queue for synchronizing computation threads and I/O thread.
		queue = new LinkedBlockingQueue<Range>();

		// Starting and ending times for each computation thread.
		int K = ParallelTeam.getDefaultThreadCount();
		comp_thr_t1 = new long [K];
		comp_thr_t2 = new long [K];
		chunk_t1 = new ArrayList [K];
		chunk_t2 = new ArrayList [K];
		for (int i = 0; i < K; ++ i)
			{
			chunk_t1[i] = new ArrayList<Long>();
			chunk_t2[i] = new ArrayList<Long>();
			}

		// Set up parallel section to compute all pixels.
		computationSection = new ParallelSection()
			{
			public void run() throws Exception
				{
				// Compute all image rows in parallel.
				new ParallelTeam().execute (new ParallelRegion()
					{
					public void run() throws Exception
						{
						final int thr = getThreadIndex();
						final ArrayList<Long> chunk_t1_thr = chunk_t1[thr];
						final ArrayList<Long> chunk_t2_thr = chunk_t2[thr];
						comp_thr_t1[thr] = System.currentTimeMillis();

						execute (0, height-1, new IntegerForLoop()
							{
							// Compute a chunk of image rows.
							public void run (int first, int last)
								throws Exception
								{
								chunk_t1_thr.add (System.currentTimeMillis());
								for (int r = first; r <= last; ++ r)
									{
									int[] matrix_r = matrix[r];
									double y = ycenter + (yoffset - r) /
										resolution;

									for (int c = 0; c < width; ++ c)
										{
										double x = xcenter + (xoffset + c) /
											resolution;

										// Iterate until convergence.
										int i = 0;
										double aold = 0.0;
										double bold = 0.0;
										double a = 0.0;
										double b = 0.0;
										double zmagsqr = 0.0;
										while (i < maxiter && zmagsqr <= 4.0)
											{
											++ i;
											a = aold*aold - bold*bold + x;
											b = 2.0*aold*bold + y;
											zmagsqr = a*a + b*b;
											aold = a;
											bold = b;
											}

										// Record number of iterations.
										matrix_r[c] = huetable[i];
										}
									}

								// Tell I/O thread that chunk is ready.
								queue.put (new Range (first, last));
								chunk_t2_thr.add (System.currentTimeMillis());
								}
							},
						BarrierAction.NO_WAIT);

						comp_thr_t2[thr] = System.currentTimeMillis();
						}
					});

				// Inform I/O thread that we're done.
				queue.put (new Range());
				}
			};

		// Set up parallel section to write PJG image file.
		ioSection = new ParallelSection()
			{
			public void run() throws Exception
				{
				io_thr_t1 = System.currentTimeMillis();

				// Prepare to write image to PJG file.
				PJGImage.Writer writer =
					image.prepareToWrite
						(new BufferedOutputStream
							(new FileOutputStream (filename)));

				// Write image chunks until we're done.
				Range range;
				while ((range = queue.take()) .length() > 0)
					{
					writer.writeRowSlice (range);
					}

				writer.close();
				io_thr_t2 = System.currentTimeMillis();
				}
			};

		long t2 = System.currentTimeMillis();

		// Execute overlapped computation and I/O sections.
		new ParallelTeam(2).execute (new ParallelRegion()
			{
			public void run() throws Exception
				{
				execute (computationSection, ioSection);
				}
			});

		// Stop timing.
		long t3 = System.currentTimeMillis();
		System.out.println ((t2-t1) + " msec calc start");
		for (int i = 0; i < K; ++ i)
			{
			System.out.println
				("\t" + (comp_thr_t1[i]-t1) + " msec thread " + i + " start");
			for (int j = 0; j < chunk_t1[i].size(); ++ j)
				{
				System.out.println
					("\t\t" + (chunk_t1[i].get(j)-t1) + " msec chunk " + j +
					 " start");
				System.out.println
					("\t\t" + (chunk_t2[i].get(j)-t1) + " msec chunk " + j +
					 " finish");
				}
			System.out.println
				("\t" + (comp_thr_t2[i]-t1) + " msec thread " + i + " finish");
			}
		System.out.println ((t3-t1) + " msec calc finish");
		System.out.println ((io_thr_t1-t1) + " msec I/O start");
		System.out.println ((io_thr_t2-t1) + " msec I/O finish");
		System.out.println ((t3-t1) + " msec total");
		}

// Hidden operations.

	/**
	 * Print a usage message and exit.
	 */
	private static void usage()
		{
		System.err.println ("Usage: java -Dpj.nt=<K> -Dpj.schedule=<schedule> edu.rit.smp.fractal.MandelbrotSetSmp3 <width> <height> <xcenter> <ycenter> <resolution> <maxiter> <gamma> <filename>");
		System.err.println ("<K> = Number of computation processors");
		System.err.println ("<schedule> = Parallel loop schedule");
		System.err.println ("<width> = Image width (pixels)");
		System.err.println ("<height> = Image height (pixels)");
		System.err.println ("<xcenter> = X coordinate of center point");
		System.err.println ("<ycenter> = Y coordinate of center point");
		System.err.println ("<resolution> = Pixels per unit");
		System.err.println ("<maxiter> = Maximum number of iterations");
		System.err.println ("<gamma> = Used to calculate pixel hues");
		System.err.println ("<filename> = PJG image file name");
		System.exit (1);
		}

	}