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 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424
|
//******************************************************************************
//
// File: AntiprotonClu2.java
// Package: edu.rit.clu.antimatter
// Unit: Class edu.rit.clu.antimatter.AntiprotonClu2
//
// This Java source file is copyright (C) 2008 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.clu.antimatter;
import edu.rit.io.Files;
import edu.rit.mp.DoubleBuf;
import edu.rit.pj.Comm;
import edu.rit.util.Random;
import edu.rit.util.Range;
import edu.rit.vector.Vector2D;
import java.io.BufferedOutputStream;
import java.io.File;
import java.io.FileOutputStream;
/**
* Class AntiprotonClu2 is a cluster parallel program that calculates the
* positions of the antiprotons as a function of time. Each antiproton
* experiences a net repulsive force from all the other antiprotons. Each
* antiproton also experiences a force due to a magnetic field perpendicular to
* the plane in which the antiprotons move.
* <P>
* Usage: java -Dpj.np=<I>K</I> edu.rit.clu.antimatter.AntiprotonClu2
* <I>seed</I> <I>R</I> <I>dt</I> <I>steps</I> <I>snaps</I> <I>N</I>
* <I>outfile</I>
* <P>
* The program runs in <I>K</I> parallel processes. Each process writes its own
* output file. If <I>outfile</I> is specified as <TT>"out.dat"</TT>, for
* example, then process 0 writes file <TT>"out_0.dat"</TT>, process 1 writes
* file <TT>"out_1.dat"</TT>, and so on.
* <P>
* The program:
* <OL TYPE=1>
* <LI>
* Initializes a pseudorandom number generator with <I>seed</I>.
* <LI>
* Generates <I>N</I> antiprotons positioned at random in the square from
* (0.25<I>R</I>,0.25<I>R</I>) to (0.75<I>R</I>,0.75<I>R</I>).
* <LI>
* Sets each antiproton's initial velocity to 0.
* <LI>
* Stores a snapshot of the antiprotons' initial positions in the
* <I>outfile</I>.
* <LI>
* Performs <I>steps</I> time steps and stores another snapshot of the
* antiprotons' positions in the <I>outfile</I>. Each time step is <I>dt</I>.
* <LI>
* Repeats Step 5 <I>snaps</I> times. The number of snapshots stored in the
* <I>outfile</I> is <I>snaps</I>+1.
* </OL>
* <P>
* The computation is performed in parallel in multiple processors. The program
* measures the computation's running time.
* <P>
* Each process holds one slice of the position array, one slice of the velocity
* array, and one slice of the acceleration array. At each time step, each
* process calculates its own slice of the acceleration array; the slices of the
* position array are passed from process to process in a pipelined fashion.
* After all position array slices have passed through all processes, each
* process uses its slice of the acceleration array to update its slices of the
* velocity and position arrays. Each process writes snapshots of its own slice
* of the position array into the process's own output file.
*
* @author Alan Kaminsky
* @version 09-Feb-2008
*/
public class AntiprotonClu2
{
// Prevent construction.
private AntiprotonClu2()
{
}
// Hidden constants.
// Charge on an antiproton.
static final double QP = 3.0;
// Magnetic field strength.
static final double B = 3.0;
static final double QP_QP = QP * QP;
static final double QP_B = QP * B;
// Hidden variables.
// World communicator.
static Comm world;
static int size;
static int rank;
static int predRank;
static int succRank;
// Command line arguments.
static long seed;
static double R;
static double dt;
static int steps;
static int snaps;
static int N;
static File outfile;
static double one_half_dt_sqr;
// Antiproton slices.
static Range[] slices;
static Range mySlice;
static int myLb;
static int myLen;
// Acceleration, velocity, and position vector arrays.
static Vector2D[] a;
static Vector2D[] v;
static Vector2D[] p;
// Position vector arrays to use for pipelined message passing.
static Vector2D[] p2;
static Vector2D[] p3;
// Position vector array communication buffers.
static DoubleBuf pbuf;
static DoubleBuf p2buf;
static DoubleBuf p3buf;
// Temporary storage.
static Vector2D temp = new Vector2D();
// Total momentum.
static Vector2D totalMV = new Vector2D();
// Main program.
/**
* Main program.
*/
public static void main
(String[] args)
throws Exception
{
// Start timing.
long t1 = System.currentTimeMillis();
// Initialize world communicator.
Comm.init (args);
world = Comm.world();
size = world.size();
rank = world.rank();
predRank = (rank - 1 + size) % size;
succRank = (rank + 1) % size;
// Parse command line arguments.
if (args.length != 7) usage();
seed = Long.parseLong (args[0]);
R = Double.parseDouble (args[1]);
dt = Double.parseDouble (args[2]);
steps = Integer.parseInt (args[3]);
snaps = Integer.parseInt (args[4]);
N = Integer.parseInt (args[5]);
outfile = new File (args[6]);
one_half_dt_sqr = 0.5 * dt * dt;
// Set up antiproton slices.
slices = new Range (0, N-1) .subranges (size);
mySlice = slices[rank];
myLb = mySlice.lb();
myLen = mySlice.length();
// Create pseudorandom number generator.
Random prng = Random.getInstance (seed);
prng.skip (2 * myLb);
// Initialize acceleration, velocity, and position vector arrays with
// this process's slice of antiprotons.
a = new Vector2D [myLen];
v = new Vector2D [myLen];
p = new Vector2D [myLen];
for (int i = 0; i < myLen; ++ i)
{
a[i] = new Vector2D();
v[i] = new Vector2D();
p[i] = new Vector2D
(prng.nextDouble()*R/2+R/4, prng.nextDouble()*R/2+R/4);
}
// Initialize position vector arrays for pipelined message passing.
p2 = new Vector2D [myLen+1];
p3 = new Vector2D [myLen+1];
for (int i = 0; i <= myLen; ++ i)
{
p2[i] = new Vector2D();
p3[i] = new Vector2D();
}
// Set up position array communication buffers.
pbuf = Vector2D.doubleBuffer (p);
p2buf = Vector2D.doubleBuffer (p2);
p3buf = Vector2D.doubleBuffer (p3);
// Set up output file and write initial snapshot.
AntiprotonFile out =
new AntiprotonFile (seed, R, dt, steps, snaps+1, N, myLb, myLen);
AntiprotonFile.Writer writer =
out.prepareToWrite
(new BufferedOutputStream
(new FileOutputStream
(Files.fileForRank (outfile, rank))));
writer.writeSnapshot (p, 0, totalMV);
long t2 = System.currentTimeMillis();
// Do <snaps> snapshots.
for (int s = 0; s < snaps; ++ s)
{
// Advance time by <steps> steps.
for (int t = 0; t < steps; ++ t)
{
// Compute accelerations due to this process's antiprotons.
computeAccelerationThisSlice();
// Do <size>-1 rounds of pipelined message passing.
DoubleBuf outbuf = pbuf;
DoubleBuf inbuf = p3buf;
for (int k = 1; k < size; ++ k)
{
// Shift position slices through the pipeline.
world.sendReceive (predRank, outbuf, succRank, inbuf);
// Swap outgoing and incoming position slices and buffers.
Vector2D[] ptmp = p2; p2 = p3; p3 = ptmp;
DoubleBuf tmpbuf = p2buf; p2buf = p3buf; p3buf = tmpbuf;
outbuf = p2buf;
inbuf = p3buf;
// Compute accelerations due to other process's antiprotons.
computeAccelerationOtherSlice ((rank + k) % size);
}
// Move this process's antiprotons.
step();
}
// Compute total momentum.
computeTotalMomentum();
// Write snapshot.
writer.writeSnapshot (p, 0, totalMV);
}
// Close output file.
writer.close();
// Stop timing.
long t3 = System.currentTimeMillis();
System.out.println ((t2-t1) + " msec pre " + rank);
System.out.println ((t3-t2) + " msec calc " + rank);
System.out.println ((t3-t1) + " msec total " + rank);
}
// Hidden operations.
/**
* Compute this process's slice of the antiproton accelerations due to the
* repulsive forces from this process's slice of the antiprotons.
*/
private static void computeAccelerationThisSlice()
{
// Accumulate forces between each pair of antiprotons, but not between
// an antiproton and itself.
for (int i = 0; i < myLen; ++ i)
{
Vector2D a_i = a[i];
Vector2D p_i = p[i];
for (int j = 0; j < i; ++ j)
{
temp.assign (p_i);
temp.sub (p[j]);
double dsqr = temp.sqrMag();
temp.mul (QP_QP / (dsqr * Math.sqrt(dsqr)));
a_i.add (temp);
}
for (int j = i+1; j < myLen; ++ j)
{
temp.assign (p_i);
temp.sub (p[j]);
double dsqr = temp.sqrMag();
temp.mul (QP_QP / (dsqr * Math.sqrt(dsqr)));
a_i.add (temp);
}
}
}
/**
* Compute this process's slice of the antiproton accelerations due to the
* repulsive forces from another process's slice of the antiprotons (located
* in p2).
*
* @param fromRank Other process's rank.
*/
private static void computeAccelerationOtherSlice
(int fromRank)
{
int otherLen = slices[fromRank].length();
// Accumulate forces between each pair of antiprotons.
for (int i = 0; i < myLen; ++ i)
{
Vector2D a_i = a[i];
Vector2D p_i = p[i];
for (int j = 0; j < otherLen; ++ j)
{
temp.assign (p_i);
temp.sub (p2[j]);
double dsqr = temp.sqrMag();
temp.mul (QP_QP / (dsqr * Math.sqrt(dsqr)));
a_i.add (temp);
}
}
}
/**
* Take one time step.
*/
private static void step()
{
// Move all antiprotons in this slice.
for (int i = 0; i < myLen; ++ i)
{
Vector2D a_i = a[i];
Vector2D v_i = v[i];
Vector2D p_i = p[i];
// Accumulate acceleration on antiproton from magnetic field.
temp.assign (v_i) .mul (QP_B) .rotate270();
a_i.add (temp);
// Update antiproton's position and velocity.
temp.assign (v_i);
p_i.add (temp.mul (dt));
temp.assign (a_i);
p_i.add (temp.mul (one_half_dt_sqr));
temp.assign (a_i);
v_i.add (temp.mul (dt));
// Clear antiproton's acceleration for the next step.
a_i.clear();
}
}
/**
* Compute the total momentum for this process's slice of the antiprotons.
* The answer is stored in <TT>totalMV</TT>.
*/
private static void computeTotalMomentum()
{
totalMV.clear();
for (int i = 0; i < myLen; ++ i)
{
totalMV.add (v[i]);
}
}
/**
* Print a usage message and exit.
*/
private static void usage()
{
System.err.println ("Usage: java -Dpj.np=<K> edu.rit.clu.antimatter.AntiprotonClu2 <seed> <R> <dt> <steps> <snaps> <N> <outfile>");
System.err.println ("<K> = Number of parallel processes");
System.err.println ("<seed> = Random seed for initial antiproton positions");
System.err.println ("<R> = Side of square for initial antiproton positions");
System.err.println ("<dt> = Time step size");
System.err.println ("<steps> = Number of time steps between snapshots");
System.err.println ("<snaps> = Number of snapshots");
System.err.println ("<N> = Number of antiprotons");
System.err.println ("<outfile> = Output file name");
System.exit (1);
}
}
|