1 /**************************************************************************
3 * Java Grande Forum Benchmark Suite - Thread Version 1.0 *
7 * Java Grande Benchmarking Project *
11 * Edinburgh Parallel Computing Centre *
13 * email: epcc-javagrande@epcc.ed.ac.uk *
15 * adapted from SciMark 2.0, author Roldan Pozo (pozo@cam.nist.gov) *
17 * This version copyright (c) The University of Edinburgh, 2001. *
18 * All rights reserved. *
20 **************************************************************************/
22 class SORRunner extends Thread {
24 int id,num_iterations;
28 public SORRunner(int id, double omega, double G[][], int num_iterations, int nthreads) {
32 this.num_iterations=num_iterations;
33 this.nthreads = nthreads;
37 int tmpid, M, N, numthreads;
38 double omega_over_four, one_minus_omega;
41 barr = new Barrier("128.195.175.79");
42 int ilow, iupper, slice, tslice, ttslice, Mm1, Nm1;
45 System.printString("Inside atomic 1\n");
48 omega_over_four = omega * 0.25;
49 one_minus_omega = 1.0 - omega;
50 numthreads = nthreads;
52 numiterations = num_iterations;
56 ttslice = (tslice + numthreads-1)/numthreads;
59 iupper = ((tmpid+1)*slice)+1;
60 if (iupper > Mm1) iupper = Mm1+1;
61 if (tmpid == (numthreads-1)) iupper = Mm1+1;
62 for(int i=ilow;i<iupper;i++) {
63 G[i]=global new double[N];
67 Barrier.enterBarrier(barr);
69 Random rand=new Random();
70 for(int i=ilow;i<iupper;i++) {
73 R[j]=rand.nextDouble() * 1e-6;
76 Barrier.enterBarrier(barr);
78 // update interior points
82 for (int p=0; p<2*numiterations; p++) {
84 for (int i=ilow+(p%2); i<iupper; i=i+2) {
87 double [] Gim1 = G[i-1];
90 double [] Gip1 = G[i+1];
92 for (int j=1; j<Nm1; j=j+2){
93 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
94 + Gi[j+1]) + one_minus_omega * Gi[j];
97 } else if (i == Mm1) {
99 double [] Gim2 = G[i-2];
101 for (int j=1; j<Nm1; j=j+2){
103 Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
104 + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
110 double [] Gip1 = G[i+1];
111 double [] Gim2 = G[i-2];
113 for (int j=1; j<Nm1; j=j+2){
114 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
115 + Gi[j+1]) + one_minus_omega * Gi[j];
118 Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
119 + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
126 Barrier.enterBarrier(barr);