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
|
//******************************************************************************
//
// File: Test13.java
// Package: edu.rit.pj.test
// Unit: Class edu.rit.pj.test.Test13
//
// 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.pj.test;
import edu.rit.pj.ParallelRegion;
import edu.rit.pj.ParallelTeam;
import edu.rit.util.Random;
import edu.rit.util.Range;
import java.io.BufferedOutputStream;
import java.io.DataOutputStream;
import java.io.File;
import java.io.FileOutputStream;
/**
* Class Test13 is a unit test main program for the SMP barrier functionality in
* package {@linkplain edu.rit.pj}. The program does the O(<I>N</I><SUP>3</SUP>)
* Floyd's Algorithm on an <I>N</I>x<I>N</I> matrix filled with random data. The
* final matrix is stored in a binary file using java.io.DataOutput. Running
* time measurements are for the computational core only, not including
* initializing the matrix or writing the output file.
* <P>
* Usage: java -Dpj.nt=<I>K</I> edu.rit.pj.test.Test13 <I>seed</I> <I>N</I>
* <I>file</I>
* <BR><I>K</I> = Number of parallel threads
* <BR><I>seed</I> = Random seed
* <BR><I>N</I> = Matrix size (<I>N</I>x<I>N</I>)
* <BR><I>file</I> = Output file name
*
* @author Alan Kaminsky
* @version 20-Dec-2007
*/
public class Test13
{
// Prevent construction.
private Test13()
{
}
// Global variables.
// Command line arguments.
static long seed;
static int N;
static File file;
// Distance matrix.
static double[][] D;
// Main program.
/**
* Unit test main program.
*/
public static void main
(String[] args)
throws Exception
{
// Parse command line arguments.
if (args.length != 3) usage();
seed = Long.parseLong (args[0]);
N = Integer.parseInt (args[1]);
file = new File (args[2]);
// Set up distance matrix.
D = new double [N] [N+16]; // 128 bytes extra padding in each row
Random prng = Random.getInstance (seed);
for (int i = 0; i < N; ++ i)
{
double[] D_i = D[i];
for (int j = 0; j < N; ++ j)
{
D_i[j] = prng.nextDouble();
}
}
// Start timing.
long time = -System.currentTimeMillis();
// Parallel region.
new ParallelTeam().execute (new ParallelRegion()
{
public void run() throws Exception
{
// Determine this thread's middle loop range.
int size = getThreadCount();
int rank = getThreadIndex();
Range range = new Range (0, N-1) .subrange (size, rank);
int lb = range.lb();
int ub = range.ub();
// Outer loop, N iterations.
for (int i = 0; i < N; ++ i)
{
double[] D_i = D[i];
// Middle loop, N iterations in parallel.
for (int j = lb; j <= ub; ++ j)
{
double[] D_j = D[j];
// Inner loop, N iterations.
for (int k = 0; k < N; ++ k)
{
D_j[k] = Math.min (D_j[k], D_j[i] + D_i[k]);
}
}
// Team threads wait for each other each outer loop
// iteration.
barrier();
}
}
});
// Stop timing.
time += System.currentTimeMillis();
// Write output file.
DataOutputStream out =
new DataOutputStream
(new BufferedOutputStream
(new FileOutputStream (file)));
for (int i = 0; i < N; ++ i)
{
double[] D_i = D[i];
for (int j = 0; j < N; ++ j)
{
out.writeDouble (D_i[j]);
}
}
out.close();
System.out.println (time);
}
/**
* Print a usage message and exit.
*/
private static void usage()
{
System.err.println ("Usage: java -Dpj.nt=<K> edu.rit.pj.test.Test13 <seed> <N> <file>");
System.err.println ("<K> = Number of parallel threads");
System.err.println ("<seed> = Random seed");
System.err.println ("<N> = Matrix size (NxN)");
System.err.println ("<file> = Output file name");
System.exit (1);
}
}
|
