File: Runner.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 (311 lines) | stat: -rw-r--r-- 9,952 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
//******************************************************************************
//
// File:    Runner.java
// Package: edu.rit.pj.job
// Unit:    Class edu.rit.pj.job.Runner
//
// This Java source file is copyright (C) 2010 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.pj.job;

import edu.rit.mp.BooleanBuf;

import edu.rit.mp.buf.BooleanItemBuf;

import edu.rit.pj.Comm;
import edu.rit.pj.WorkerIteration;
import edu.rit.pj.WorkerRegion;
import edu.rit.pj.WorkerTeam;

import edu.rit.util.Instance;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;

import java.util.Date;
import java.util.HashSet;
import java.util.Scanner;

/**
 * Class Runner is a parallel program that runs, in parallel, a group of
 * {@linkplain Job}s created by a {@linkplain JobGenerator}. The job generator
 * is specified on the command line as a constructor expression. An instance of
 * the class specified in the constructor expression is constructed, with the
 * constructor arguments specified in the constructor expression. For further
 * information, see class {@linkplain edu.rit.util.Instance Instance}.
 * <P>
 * The Runner program is targeted at three use cases:
 * <UL>
 * <P><LI>
 * <B>Sequential jobs on a cluster parallel computer.</B> Each job is a
 * sequential (single-threaded) program. The Runner program is running on a
 * cluster parallel computer with <I>N</I> nodes and one CPU per node. Run the
 * Runner program as follows:
 * <PRE>
 *     java -Dpj.nn=<I>N</I> edu.rit.pj.job.Runner . . .
 * </PRE>
 * The Runner program runs with one process per node and one thread per process.
 * <P><LI>
 * <B>Sequential jobs on a hybrid parallel computer.</B> Each job is a
 * sequential (single-threaded) program. The Runner program is running on a
 * hybrid SMP cluster parallel computer with <I>N</I> nodes and <I>C</I> total
 * CPUs. (For example, on a hybrid parallel computer with 10 nodes and 4 CPUs
 * per node, <I>C</I> = 40.) Run the Runner program as follows:
 * <PRE>
 *     java -Dpj.nn=<I>N</I> -Dpj.np=<I>C</I> edu.rit.pj.job.Runner . . .
 * </PRE>
 * The Runner program runs with multiple processes per node and one thread per
 * process.
 * <P><LI>
 * <B>SMP parallel jobs on a hybrid parallel computer.</B> Each job is an SMP
 * parallel (multi-threaded) program. The Runner program is running on a hybrid
 * SMP cluster parallel computer with <I>N</I> nodes and multiple CPUs per node.
 * Run the Runner program as follows:
 * <PRE>
 *     java -Dpj.nn=<I>N</I> edu.rit.pj.job.Runner . . .
 * </PRE>
 * The Runner program runs with one process per node and multiple threads per
 * process, typically as many threads as there are CPUs on the node.
 * </UL>
 * <P>
 * All these processes form a <I>worker team.</I> The Runner program uses the
 * job generator specified on the command line to create jobs and sends each job
 * to a worker team process to be executed.
 * <P>
 * When the Runner program starts, it prints the job generator constructor
 * expression on the standard output. Whenever a job starts or finishes, the
 * Runner program prints a log message on the standard output consisting of the
 * job's number and description.
 * <P>
 * <B>Checkpointing.</B> It is recommended to redirect the Runner program's
 * standard output into a <I>checkpoint file.</I> If a failure occurs before the
 * Runner program finishes running all the jobs, the checkpoint file contains a
 * record of the job generator that was used as well as which jobs did and did
 * not finish. To resume the Runner program where it left off, specify the
 * checkpoint file name on the command line instead of a job generator
 * constructor expression. The Runner program reads the checkpoint file to
 * determine the job generator and the jobs that finished. The Runner program
 * then generates and runs the jobs that did not finish.
 * <P>
 * Usage: java edu.rit.pj.job.Runner { <I>generator</I> | <I>file</I> }
 * <BR><I>generator</I> = Job generator constructor expression
 * <BR><I>file</I> = Checkpoint file name
 *
 * @author  Alan Kaminsky
 * @version 22-Oct-2010
 */
public class Runner
	{

// Prevent construction.

	private Runner()
		{
		}

// Global variables.

	private static PrintStream stdout = System.out;
	private static PrintStream stderr = System.err;

	private static Comm world;
	private static int rank;

	private static WorkerTeam team;

	private static String generatorExpression;
	private static HashSet<Integer> omitted;
	private static JobGenerator generator;

// Main program.

	/**
	 * Main program.
	 */
	public static void main
		(String[] args)
		throws Exception
		{
		if (args.length != 1) usage();

		// Initialize world communicator.
		Comm.init (args);
		world = Comm.world();
		rank = world.rank();

		// Set up worker team.
		team = new WorkerTeam();

		// Master process sets up job generator.
		if (rank == team.masterRank())
			{
			omitted = new HashSet<Integer>();

			// Assume argument is a checkpoint file name and try to read it.
			Scanner scanner = null;
			try
				{
				scanner = new Scanner (new File (args[0]));
				}
			catch (IOException exc)
				{
				}

			// Read checkpoint file.
			if (scanner != null)
				{
				while (scanner.hasNextLine())
					{
					Scanner linescanner = new Scanner (scanner.nextLine());
					String word;
					int jobnum;
					if (! linescanner.hasNext()) continue;
					word = linescanner.next();
					if (! word.equals ("***")) continue;
					if (! linescanner.hasNext()) continue;
					word = linescanner.next();
					if (word.equals ("Generator"))
						{
						if (! linescanner.hasNext()) continue;
						if (generatorExpression == null)
							{
							generatorExpression = linescanner.next();
							}
						}
					else if (word.equals ("Job"))
						{
						if (! linescanner.hasNextInt()) continue;
						jobnum = linescanner.nextInt();
						if (! linescanner.hasNext()) continue;
						word = linescanner.next();
						if (word.equals ("finished")) omitted.add (jobnum);
						}
					}
				scanner.close();
				}

			// Assume argument is a job generator constructor expression.
			else
				{
				generatorExpression = args[0];
				}

			// Create job generator.
			if (generatorExpression == null)
				{
				stderr.printf
					("Runner: No job generator in checkpoint file %s%n",
					 args[0]);
				}
			else
				{
				try
					{
					generator = (JobGenerator)
						Instance.newInstance (generatorExpression);
					stdout.printf
						("*** Generator %s%n", generatorExpression);
					generator.omit (omitted);
					}
				catch (Throwable exc)
					{
					stderr.printf
						("Runner: Could not create job generator %s%n",
						 generatorExpression);
					exc.printStackTrace (stderr);
					}
				}
			}

		// Abort every process if job generator was not created.
		BooleanItemBuf buf = BooleanBuf.buffer (generator != null);
		world.broadcast (team.masterRank(), buf);
		if (! buf.item) System.exit (1);

		// Generate and run jobs.
		team.execute (new WorkerRegion()
			{
			public void run() throws Exception
				{
				execute (generator, new WorkerIteration<Job>()
					{
					public void sendTaskInput
						(Job job, Comm comm, int wRank, int tag)
						{
						stdout.printf
							("*** Job %d started %s %s%n",
							 job.getJobNumber(),
							 new Date(),
							 job.getDescription());
						}

					public void run (Job job)
						{
						job.run();
						}

					public void receiveTaskOutput
						(Job job, Comm comm, int wRank, int tag)
						{
						stdout.printf
							("*** Job %d finished %s%n",
							 job.getJobNumber(),
							 new Date());
						}
					});
				}
			});

		if (rank == team.masterRank())
			{
			stdout.printf ("*** All jobs finished%n");
			}
		}

// Hidden operations.

	/**
	 * Print a usage message and exit.
	 */
	private static void usage()
		{
		stderr.println ("Usage: java edu.rit.pj.job.Runner {<generator>|<file>}");
		stderr.println ("<generator> = Job generator constructor expression");
		stderr.println ("<file> = Checkpoint file name");
		System.exit (1);
		}

	}