From: adash <adash>
Date: Mon, 12 Jan 2009 22:47:47 +0000 (+0000)
Subject: add new files
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=1fb3d6c20fe38330391303e2aa6a991bcb94b88e;p=IRC.git

add new files
---

diff --git a/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyN.java b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyN.java
new file mode 100644
index 00000000..e7a07bd7
--- /dev/null
+++ b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyN.java
@@ -0,0 +1,151 @@
+public class MatrixMultiply {
+  MMul mmul;
+  public int x0, y0, x1, y1;
+  public MatrixMultiply(MMul mmul, int x0, int x1, int y0, int y1) {
+    this.mmul = mmul;
+    this.x0 = x0;
+    this.y0 = y0;
+    this.x1 = x1;
+    this.y1 = y1;
+  }
+
+  public void run() {
+    double la[][]=mmul.a;
+    double lc[][]=mmul.c;
+    double lb[][]=mmul.btranspose;
+    int M=mmul.M;
+
+    //Use btranspose for cache performance
+    for(int i = x0; i< x1; i++){
+      double a[]=la[i];
+      double c[]=lc[i];
+      for (int j = y0; j < y1; j++) {
+        double innerProduct=0;
+        double b[] = lb[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=600;
+    if (args.length>0) {
+      NUM_THREADS=Integer.parseInt(args[0]);
+      if (args.length>1)
+        SIZE=Integer.parseInt(args[1]);
+    }
+
+    /*
+    int[] mid = new int[8];
+    mid[0] = (128<<24)|(195<<16)|(175<<8)|84; //dw-10
+    mid[1] = (128<<24)|(195<<16)|(175<<8)|85; //dw-11
+    mid[2] = (128<<24)|(195<<16)|(175<<8)|86; //dw-12
+    mid[3] = (128<<24)|(195<<16)|(175<<8)|87; //dw-13
+    mid[4] = (128<<24)|(195<<16)|(175<<8)|88; //dw-14
+    mid[5] = (128<<24)|(195<<16)|(175<<8)|89; //dw-15
+    mid[6] = (128<<24)|(195<<16)|(175<<8)|90; //dw-16
+    mid[7] = (128<<24)|(195<<16)|(175<<8)|91; //dw-17
+    */
+    int p, q, r;
+    MatrixMultiply[] mm;
+    MatrixMultiply tmp;
+    MMul matrix;
+
+    matrix = new MMul(SIZE, SIZE, SIZE);
+    matrix.setValues();
+    matrix.transpose();
+    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);
+      else
+        mm[i]= new MatrixMultiply(matrix,base, base+increment, 0, SIZE);
+      base+=increment;
+    }
+    p = matrix.L;
+    q = matrix.M;
+    r = matrix.N;
+
+    // print out the matrices to be multiplied
+    System.printString("\n");
+    System.printString("MatrixMultiply: L=");
+    System.printInt(p);
+    System.printString("\t");
+    System.printString("M=");
+    System.printInt(q);
+    System.printString("\t");
+    System.printString("N=");
+    System.printInt(r);
+    System.printString("\n");
+
+    for(int i=0;i<NUM_THREADS;i++) {
+      mm[i].run();
+    }
+
+    // print out the result of the matrix multiply
+    System.printString("Finished\n");
+  }
+}
+
+public class MMul{
+
+  public int L, M, N;
+  public double[][] a;
+  public double[][] b;
+  public double[][] c;
+  public double[][] btranspose;
+
+  public MMul(int L, int M, int N) {
+    this.L = L;
+    this.M = M;
+    this.N = N;
+    a = new double[L][M];  
+    b = new double[M][N]; 
+    c = new double[L][N]; 
+    btranspose = new double[N][M];
+  }
+
+  public void setValues() {
+    for(int i = 0; i < L; i++) {
+      double ai[] = a[i];
+      for(int j = 0; j < M; j++) {
+        ai[j] = j+1;
+      }
+    }
+
+    for(int i = 0; i < M; i++) {
+      double bi[] = b[i];
+      for(int j = 0; j < N; j++) {
+        bi[j] = j+1;
+      }
+    }
+
+    for(int i = 0; i < L; i++) {
+      double ci[] = c[i];
+      for(int j = 0; j < N; j++) {
+        ci[j] = 0;
+      }
+    }
+    for(int i = 0; i < N; i++) {
+      double btransposei[] = btranspose[i];
+      for(int j = 0; j < M; j++) {
+        btransposei[j] = 0;
+      }
+    }
+  }
+
+  public void transpose() {
+    for(int row = 0; row < M; row++) {
+      double brow[] = b[row];
+      for(int col = 0; col < N; col++) {
+        btranspose[col][row] = brow[col];
+      }
+    }
+  }
+}
diff --git a/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyNrun.java b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyNrun.java
new file mode 100644
index 00000000..0df8c34d
--- /dev/null
+++ b/Robust/src/Benchmarks/Prefetch/MatrixMultiply/javasingle/MatrixMultiplyNrun.java
@@ -0,0 +1,135 @@
+public class MatrixMultiply {
+  MMul mmul;
+  public int x0, y0, x1, y1;
+
+  public MatrixMultiply(MMul mmul, int x0, int x1, int y0, int y1) {
+    this.mmul = mmul;
+    this.x0 = x0;
+    this.y0 = y0;
+    this.x1 = x1;
+    this.y1 = y1;
+  }
+
+  public void run() {
+    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);
+    matrix.setValues();
+    matrix.transpose();
+    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);
+      else
+        mm[i]=new MatrixMultiply(matrix,base, base+increment, 0, SIZE);
+      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[][][] b;
+  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][M];  
+    b = new double[P][M][N]; 
+    c = new double[P][L][N]; 
+    btranspose = new double[P][N][M];
+  }
+
+  public void setValues() {
+    for(int q = 0; q < P; q++) {
+      for(int i = 0; i < L; i++) {
+        double ai[] = a[q][i];
+        for(int j = 0; j < M; j++) {
+          ai[j] = j+1;
+        }
+      }
+
+      for(int i = 0; i < M; i++) {
+        double bi[] = b[q][i];
+        for(int j = 0; j < N; j++) {
+          bi[j] = j+1;
+        }
+      }
+    }
+  }
+
+  public void transpose() {
+    for(int q=0;q<P;q++) {
+      double br[][]=b[q];
+      double bt[][]=btranspose[q];
+      for(int row = 0; row < M; row++) {
+        double brow[] = br[row];
+        for(int col = 0; col < N; col++) {
+          bt[col][row] = brow[col];
+        }
+      }
+    }
+  }
+}