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;
29 public SORRunner(int id, double omega, double G[][], int num_iterations,int[][] sync, int nthreads) {
33 this.num_iterations=num_iterations;
35 this.nthreads = nthreads;
39 int tmpid, M, N, numthreads;
40 double omega_over_four, one_minus_omega;
45 omega_over_four = omega * 0.25;
46 one_minus_omega = 1.0 - omega;
47 numthreads = nthreads;
49 numiterations = num_iterations;
52 // update interior points
58 int ilow, iupper, slice, tslice, ttslice;
61 ttslice = (tslice + numthreads-1)/numthreads;
64 iupper = ((tmpid+1)*slice)+1;
65 if (iupper > Mm1) iupper = Mm1+1;
66 if (tmpid == (numthreads-1)) iupper = Mm1+1;
68 for (int p=0; p<2*numiterations; p++) {
70 for (int i=ilow+(p%2); i<iupper; i=i+2) {
73 double [] Gim1 = G[i-1];
76 double [] Gip1 = G[i+1];
78 for (int j=1; j<Nm1; j=j+2){
79 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
80 + Gi[j+1]) + one_minus_omega * Gi[j];
83 } else if (i == Mm1) {
85 double [] Gim2 = G[i-2];
87 for (int j=1; j<Nm1; j=j+2){
89 Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
90 + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
96 double [] Gip1 = G[i+1];
97 double [] Gim2 = G[i-2];
99 for (int j=1; j<Nm1; j=j+2){
100 Gi[j] = omega_over_four * (Gim1[j] + Gip1[j] + Gi[j-1]
101 + Gi[j+1]) + one_minus_omega * Gi[j];
104 Gim1[j+1]=omega_over_four * (Gim2[j+1] + Gi[j+1] + Gim1[j]
105 + Gim1[j+2]) + one_minus_omega * Gim1[j+1];
116 // Signal this thread has done iteration
118 ourcount=sync[tmpid][0];
121 // Wait for neighbours;
124 if ((tmpid==0 || ourcount <= sync[tmpid-1][0])
125 &&((tmpid==(numthreads-1))||ourcount<=sync[tmpid+1][0]))
130 System.clearPrefetchCache();