new javasingle version

diff --git a/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyD.java b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyD.java
new file mode 100644 (file)
index 0000000..84bd597
--- /dev/null
+++ b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyD.java
@@ -0,0 +1,138 @@
+public class MatrixMultiply extends Thread{
+  MMul mmul;
+  public int x0, y0, x1, y1;
+  public int tid, numthreads;
+
+  public MatrixMultiply(MMul mmul, int x0, int x1, int y0, int y1, int tid, int numthreads) {
+    this.mmul = mmul;
+    this.x0 = x0;
+    this.y0 = y0;
+    this.x1 = x1;
+    this.y1 = y1;
+    this.tid=tid;
+    this.numthreads=numthreads;
+  }
+
+  public void run() {
+    mmul.setValues(tid, numthreads);
+
+
+    double la[][][]=mmul.a;
+    double lc[][][]=mmul.c;
+    double lb[][][]=mmul.btranspose;
+    int M=mmul.M;
+    int P=mmul.P;
+    //Use btranspose for cache performance
+    for(int q=0;q<P;q++) {
+      double ra[][]=la[q];
+      double rb[][]=lb[q];
+      double rc[][]=lc[q];
+      for(int i = x0; i< x1; i++){
+        double a[]=ra[i];
+        double c[]=rc[i];
+        for (int j = y0; j < y1; j++) {
+          double innerProduct=0;
+          double b[] = rb[j];
+          for(int k = 0; k < M; k++) {
+            innerProduct += a[k] * b[k];
+          }
+          c[j]=innerProduct;
+        }
+      }
+    }
+  }
+
+  public static void main(String[] args) {
+    int NUM_THREADS = 4;
+    int SIZE=150;
+    int NUM_MATRIX = 1;
+    if (args.length>0) {
+      NUM_THREADS=Integer.parseInt(args[0]);
+      if (args.length>1) {
+        SIZE=Integer.parseInt(args[1]);
+        if (args.length>2)
+          NUM_MATRIX=Integer.parseInt(args[2]);
+      }
+    }
+
+    int p, q, r;
+    MatrixMultiply[] mm;
+    MatrixMultiply tmp;
+    MMul matrix;
+
+    matrix = new MMul(NUM_MATRIX, SIZE, SIZE, SIZE);
+    mm = new MatrixMultiply[NUM_THREADS];
+    int increment=SIZE/NUM_THREADS;
+    int base=0;
+    for(int i=0;i<NUM_THREADS;i++) {
+      if ((i+1)==NUM_THREADS)
+        mm[i]= new MatrixMultiply(matrix,base, SIZE, 0, SIZE, i, NUM_THREADS);
+      else
+        mm[i]= new MatrixMultiply(matrix,base, base+increment, 0, SIZE, i, NUM_THREADS);
+      base+=increment;
+    }
+    p = matrix.L;
+    q = matrix.M;
+    r = matrix.N;
+
+
+    // start a thread to compute each c[l,n]
+    for (int i = 0; i < NUM_THREADS; i++) {
+      tmp = mm[i];
+      tmp.run();
+    }
+
+    // print out the result of the matrix multiply
+    System.printString("Finished\n");
+  }
+}
+
+public class MMul{
+  public int L, M, N, P;
+  public double[][][] a;
+  public double[][][] c;
+  public double[][][] btranspose;
+
+  public MMul(int P, int L, int M, int N) {
+    this.L = L;
+    this.M = M;
+    this.N = N;
+    this.P = P;
+    a =  new double[P][L][];
+    c =  new double[P][L][];
+    btranspose =  new double[P][N][];
+  }
+
+  public void setValues(int tid, int numthreads) {
+    if(tid==0) {
+      for(int q = 0; q < P; q++) {
+        for(int i = 0; i < L; i++) {
+          double ai[] =  new double[M];
+          for(int j = 0; j < M; j++) {
+            ai[j] = j+1;
+          }
+          a[q][i]=ai;
+        }
+      }
+      for(int q = 0; q < P; q++) {
+        for(int i = 0; i < L; i++) {
+          c[q][i]= new double[N];
+        }
+      }
+    }
+    if(tid>0||numthreads==1) {
+      int delta=numthreads>1?numthreads-1:1;
+      int start=numthreads>1?tid-1:0;
+
+      for(int q = start; q < P; q+=delta) {
+        for(int i = 0; i < N; i++) {
+          double bi[] =  new double[M];
+          for(int j = 0; j < M; j++) {
+            bi[j] = j+1;
+          }
+          btranspose[q][i]=bi;
+        }
+      }
+    }
+  }
+}