Robust/src/Benchmarks/oooJava/sor/SORRunner.java

   1 /**************************************************************************
   2  *                                                                         *
   3  *         Java Grande Forum Benchmark Suite - Thread Version 1.0          *
   4  *                                                                         *
   5  *                            produced by                                  *
   6  *                                                                         *
   7  *                  Java Grande Benchmarking Project                       *
   8  *                                                                         *
   9  *                                at                                       *
  10  *                                                                         *
  11  *                Edinburgh Parallel Computing Centre                      *
  12  *                                                                         *
  13  *                email: epcc-javagrande@epcc.ed.ac.uk                     *
  14  *                                                                         *
  15  *      adapted from SciMark 2.0, author Roldan Pozo (pozo@cam.nist.gov)   *
  16  *                                                                         *
  17  *      This version copyright (c) The University of Edinburgh, 2001.      *
  18  *                         All rights reserved.                            *
  19  *                                                                         *
  20  **************************************************************************/
  21
  22 class SORRunner  {
  23
  24   int id, num_iterations;
  25   double G[][],omega;
  26   int nthreads;
  27   long RANDOM_SEED;
  28
  29   public SORRunner(int id, double omega, double G[][], int num_iterations, int nthreads, long RANDOM_SEED) {
  30     this.id = id;
  31     this.omega=omega;
  32     this.G=G;
  33     this.num_iterations=num_iterations;
  34     this.nthreads = nthreads;
  35     this.RANDOM_SEED =  RANDOM_SEED;
  36   }
  37
  38   public void run() {
  39     int tmpid, M, N, numthreads;
  40     double omega_over_four, one_minus_omega;
  41     int numiterations;
  42     int ilow, iupper, slice, tslice, ttslice, Mm1, Nm1;
  43
  44     N = M = G.length;
  45
  46     omega_over_four = omega * 0.25;
  47     one_minus_omega = 1.0 - omega;
  48     numthreads = nthreads;
  49     tmpid = id;
  50     numiterations = num_iterations;
  51     Mm1 = M-1;
  52     Nm1 = N-1;
  53     tslice = (Mm1) / 2;
  54     ttslice = (tslice + numthreads-1)/numthreads;
  55     slice = ttslice*2;
  56     ilow=tmpid*slice+1;
  57     iupper = ((tmpid+1)*slice)+1;
  58     if (iupper > Mm1) iupper =  Mm1+1;
  59     if (tmpid == (numthreads-1)) iupper = Mm1+1;
  60
  61     //barrier
  62
  63     Random rand=new Random(RANDOM_SEED);
  64     double[] R = G[0];
  65     for(int j=0;j<M;j++)
  66       R[j]=rand.nextDouble() * 1e-6;
  67     for(int i=ilow;i<iupper;i++) {
  68       R=G[i];
  69       for(int j=0;j<M;j++)
  70         R[j]=rand.nextDouble() * 1e-6;
  71     }
  72
  73     // update interior points
  74     //
  75
  76     //barrier
  77
  78     for (int p=0; p<2*numiterations; p++) {
  79       for (int q=0;q<=2;q+=2) {//new line
  80
  81         for (int i=ilow+(p%2)+q; i<iupper; i=i+4) {//changed 2->4 and added q
  82
  83         double [] Gi = G[i];
  84         double [] Gim1 = G[i-1];
  85
  86         if(i == 1) {
  87           double [] Gip1 = G[i+1];
  88
  89           sese first {
  90           for (int j=1; j<Nm1; j=j+2){
  91             Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
  92                 + Gi[j+1]) + one_minus_omega * Gi[j];
  93
  94           }
  95           }
  96         } else if (i == Mm1) {
  97
  98         } else {
  99
 100           double [] Gip1 = G[i+1];
 101           sese second {
 102           for (int j=1; j<Nm1; j=j+2){
 103             Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
 104                 + Gi[j+1]) + one_minus_omega * Gi[j];
 105
 106           }
 107           }
 108         }
 109       }
 110       } //new line
 111
 112       //barrier
 113       for (int q=0;q<=2;q+=2) {//new line
 114         for (int i=ilow+(p%2)+q; i<iupper; i=i+4) { //added q, changed 2->4
 115
 116         double [] Gi = G[i];
 117         double [] Gim1 = G[i-1];
 118
 119         if(i == 1) {
 120         } else if (i == Mm1) {
 121
 122           double [] Gim2 = G[i-2];
 123
 124           sese three {
 125           for (int j=1; j<Nm1; j=j+2){
 126             if((j+1) != Nm1) {
 127               Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
 128                   + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
 129             }
 130           }
 131           }
 132
 133         } else {
 134
 135           double [] Gim2 = G[i-2];
 136
 137           sese four {
 138           for (int j=1; j<Nm1; j=j+2){
 139             if((j+1) != Nm1) {
 140               Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
 141                   + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
 142             }
 143           }
 144           }
 145         }
 146       }
 147       }
 148       //barrier
 149     }//end of for
 150
 151   } //end of run()
 152 }