NUM_THREADS = Integer.parseInt(args[0]);\r
filename = args[1];\r
\r
- int[] mid = new int[NUM_THREADS];\r
+ int[] mid = new int[8];\r
mid[0] = (128<<24)|(195<<16)|(180<<8)|21;//dw-2\r
mid[1] = (128<<24)|(195<<16)|(180<<8)|24;//dw-5\r
mid[2] = (128<<24)|(195<<16)|(180<<8)|26;//dw-7\r
--- /dev/null
+/* MatrixMultiplyN.java
+
+ Matrix Multiplication Benchmark using Task Library.
+ a, b, and c are two dimensional array.
+ It computes a * b and assigns to c.
+
+*/
+public class MatrixMultiply extends Task {
+ MMul mmul;
+ int SIZE;
+ int increment;
+
+ public MatrixMultiply(MMul mmul, int num_threads, int size,int increment) {
+ this.mmul = mmul;
+
+ SIZE = size;
+ this.increment = increment;
+
+ init();
+ }
+
+ public void init() {
+ todoList = global new Queue();
+
+ fillTodoList();
+ }
+
+ // fill up the Work Pool
+ public void fillTodoList() {
+ Segment seg;
+ int i;
+
+ for(i = 0; i < SIZE; i +=increment) {
+
+ if(i+increment > SIZE) {
+ seg = global new Segment(i,SIZE);
+ }
+ else {
+ seg = global new Segment(i, i + increment);
+ }
+ todoList.push(seg);
+ }
+ }
+
+ public void execute() {
+ double la[][];
+ double lc[][];
+ double lb[][];
+ double rowA[];
+ double colB[];
+ Segment seg;
+
+ double innerproduct;
+ int i,j;
+ int x0;
+ int x1;
+ int size;
+
+ // get matrix
+ atomic {
+ seg = (Segment)myWork;
+ x0 = seg.x0; // x start row
+ x1 = seg.x1; // x end row
+ la = mmul.a; // first mat
+ lb = mmul.btranspose; // second mat
+// lc = mmul.c; // destination mat
+ size = SIZE;
+ }
+
+ lc = new double[size][size];
+// System.out.println("Seg x0 = " + x0 + " - x1 = " + x1);
+
+ for(i = x0; i < x1 ; i++) {
+// System.printString("i = " + i + "\n");
+ atomic {
+ rowA = la[i]; // grab first mat's row
+
+ for(j = 0; j < size ; j++) {
+ colB = lb[j]; // grab second mat's col
+
+ innerproduct = computeProduct(rowA,colB, size); // computes the value
+
+ lc[i][j] = innerproduct; // store in dest mat
+ } // end of for j
+ }
+ } // end for i
+// }
+
+ atomic {
+ for (i = x0; i < x1; i++) {
+ for (j = 0; j < size; j++) {
+ mmul.c[i][j] = lc[i][j];
+ }
+ }
+ }
+ }
+
+ public double computeProduct(double[] rowA,double[] colB, int size)
+ {
+ int i;
+ double sum = 0;
+
+ for(i = 0 ;i < size; i++) {
+ sum += rowA[i] * colB[i];
+ }
+
+ return sum;
+ }
+
+ public void done(Object work) {
+ }
+
+ public static void main(String[] args) {
+ int NUM_THREADS=4;
+ int SIZE = 1600;
+ int increment = 80;
+ int i,j;
+ Work[] works;
+ MMul matrix;
+ MatrixMultiply mm;
+ Segment[] currentWorkList;
+
+ if (args.length == 3) {
+ NUM_THREADS = Integer.parseInt(args[0]);
+ SIZE = Integer.parseInt(args[1]);
+ increment = Integer.parseInt(args[2]); // size of subtask
+ }
+ else {
+ System.out.println("usage: ./MatrixMultiply.bin master <num_threads> <size of matrix> <size of subtask>");
+ }
+
+ int[] mid = new int[8];
+ mid[0] = (128<<24)|(195<<16)|(180<<8)|21; //dw-2
+ mid[1] = (128<<24)|(195<<16)|(180<<8)|24; //dw-5
+ mid[2] = (128<<24)|(195<<16)|(180<<8)|26; //dw-7
+/* mid[0] = (128<<24)|(195<<16)|(136<<8)|162; //dc1
+ mid[1] = (128<<24)|(195<<16)|(136<<8)|163; //dc2
+ mid[2] = (128<<24)|(195<<16)|(136<<8)|164; //dc3
+ mid[3] = (128<<24)|(195<<16)|(136<<8)|165; //dc4
+ mid[4] = (128<<24)|(195<<16)|(136<<8)|166; //dc5
+ mid[5] = (128<<24)|(195<<16)|(136<<8)|167; //dc6
+ mid[6] = (128<<24)|(195<<16)|(136<<8)|168; //dc7
+ mid[7] = (128<<24)|(195<<16)|(136<<8)|169; //dc8
+*/
+ atomic {
+ matrix = global new MMul(SIZE, SIZE, SIZE);
+ matrix.setValues();
+ matrix.transpose();
+ mm = global new MatrixMultiply(matrix, NUM_THREADS, SIZE,increment);
+
+ works = global new Work[NUM_THREADS];
+ currentWorkList = global new Segment[NUM_THREADS];
+
+ for(i = 0; i < NUM_THREADS; i++) {
+ works[i] = global new Work(mm, NUM_THREADS, i,currentWorkList);
+ }
+ }
+
+ long st = System.currentTimeMillis();
+ long fi;
+
+ Work tmp;
+ for (i = 0; i < NUM_THREADS; i++) {
+ atomic {
+ tmp = works[i];
+ }
+ Thread.myStart(tmp,mid[i]);
+ }
+
+ for (i = 0; i < NUM_THREADS; i++) {
+ atomic {
+ tmp = works[i];
+ }
+ tmp.join();
+ }
+ fi = System.currentTimeMillis();
+
+ double sum= 0;
+ atomic {
+ sum = matrix.getSum();
+ }
+
+ System.out.println("Sum of matrix = " + sum);
+ System.out.println("Time Elapse = " + (double)((fi-st)/1000));
+ 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 = global new double[L][M];
+ b = global new double[M][N];
+ c = global new double[L][N];
+ btranspose = global 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];
+ }
+ }
+ }
+
+ public double getSum() {
+ double sum =0;
+
+ for(int row =0; row < L; row++) {
+ double cr[] = c[row];
+ for(int col = 0; col < N; col++) {
+ sum += cr[col];
+ }
+ }
+ return sum;
+ }
+}
+
+public class Segment {
+ int x0;
+ int x1;
+
+ Segment (int x0, int x1) {
+ this.x0 = x0;
+ this.x1 = x1;
+ }
+}
+
+++ /dev/null
-public class MatrixMultiply extends Task {
- MMul mmul;
- int SIZE;
- int increment;
-
- public MatrixMultiply(MMul mmul, int num_threads, int size) {
- this.mmul = mmul;
-
- SIZE = size;
- increment = 80;
-
- init();
- }
-
- public void init() {
- todoList = global new Queue();
-
- fillTodoList();
- }
-
- // fill up the Work Pool
- public void fillTodoList() {
- Segment seg;
- int i;
-
- for(i = 0; i < SIZE; i +=increment) {
-
- if(i+increment > SIZE) {
- seg = global new Segment(i,SIZE);
- }
- else {
- seg = global new Segment(i, i + increment);
- }
- todoList.push(seg);
- }
- }
-
- public void execute() {
- double la[][];
- double lc[][];
- double lb[][];
- double rowA[];
- double colB[];
- Segment seg;
-
- double innerproduct;
- int i,j;
- int x0;
- int x1;
- int size;
-
- // get matrix
- atomic {
- seg = (Segment)myWork;
- x0 = seg.x0; // x start row
- x1 = seg.x1; // x end row
- la = mmul.a; // first mat
- lb = mmul.btranspose; // second mat
-// lc = mmul.c; // destination mat
- size = SIZE;
- }
-
- lc = new double[size][size];
-// System.out.println("Seg x0 = " + x0 + " - x1 = " + x1);
-
- for(i = x0; i < x1 ; i++) {
-// System.printString("i = " + i + "\n");
- atomic {
- rowA = la[i]; // grab first mat's row
-
- for(j = 0; j < size ; j++) {
- colB = lb[j]; // grab second mat's col
-
- innerproduct = computeProduct(rowA,colB, size); // computes the value
-
- lc[i][j] = innerproduct; // store in dest mat
- } // end of for j
- }
- } // end for i
-// }
- System.out.println("Finished comutation");
-
- atomic {
- for (i = x0; i < x1; i++) {
- for (j = 0; j < size; j++) {
- mmul.c[i][j] = lc[i][j];
- }
- }
- }
- }
-
- public double computeProduct(double[] rowA,double[] colB, int size)
- {
- int i;
- double sum = 0;
-
- for(i = 0 ;i < size; i++) {
-// atomic {
- sum += rowA[i] * colB[i];
-// }
- }
-
- return sum;
- }
-
- public void done(Object work) {
- }
-
- public static void main(String[] args) {
- int NUM_THREADS=4;
- int SIZE = 1600;
- int i,j;
- Work[] works;
- MMul matrix;
- MatrixMultiply mm;
- Segment[] currentWorkList;
-
- if (args.length > 0) {
- NUM_THREADS = Integer.parseInt(args[0]);
- SIZE = Integer.parseInt(args[1]);
- }
- else {
- System.out.println("usage: ./MatrixMultiply.bin master <num_threads> <size of matrix>");
- }
-
- int[] mid = new int[8];
- mid[0] = (128<<24)|(195<<16)|(136<<8)|162; //dc1
- mid[1] = (128<<24)|(195<<16)|(136<<8)|163; //dc2
- mid[2] = (128<<24)|(195<<16)|(136<<8)|164; //dc3
- mid[3] = (128<<24)|(195<<16)|(136<<8)|165; //dc4
- mid[4] = (128<<24)|(195<<16)|(136<<8)|166; //dc5
- mid[5] = (128<<24)|(195<<16)|(136<<8)|167; //dc6
- mid[6] = (128<<24)|(195<<16)|(136<<8)|168; //dc7
- mid[7] = (128<<24)|(195<<16)|(136<<8)|169; //dc8
-
- atomic {
- matrix = global new MMul(SIZE, SIZE, SIZE);
- matrix.setValues();
- matrix.transpose();
- mm = global new MatrixMultiply(matrix, NUM_THREADS, SIZE);
-
- works = global new Work[NUM_THREADS];
- currentWorkList = global new Segment[NUM_THREADS];
-
- for(i = 0; i < NUM_THREADS; i++) {
- works[i] = global new Work(mm, NUM_THREADS, i,currentWorkList);
- }
- }
- System.out.println("Finished to createObjects");
-
- long st = System.currentTimeMillis();
- long fi;
-
- Work tmp;
- for (i = 0; i < NUM_THREADS; i++) {
- atomic {
- tmp = works[i];
- }
- Thread.myStart(tmp,mid[i]);
- }
-
- for (i = 0; i < NUM_THREADS; i++) {
- atomic {
- tmp = works[i];
- }
- tmp.join();
- }
- fi = System.currentTimeMillis();
-
- System.out.println("Time Elapse = " + (double)((fi-st)/1000));
- 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 = global new double[L][M];
- b = global new double[M][N];
- c = global new double[L][N];
- btranspose = global 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];
- }
- }
- }
-}
-
-public class Segment {
- int x0;
- int x1;
-
- Segment (int x0, int x1) {
- this.x0 = x0;
- this.x1 = x1;
- }
-}
-
MAINCLASS=MatrixMultiply
-SRC1=${MAINCLASS}N.java
+SRC1=${MAINCLASS}.java
FLAGS= -recovery -recoverystats -dsm -32bit -nooptimize -debug -dsmtask -mainclass ${MAINCLASS}
public static void main(String[] args) {
int NUM_THREADS = 3;
int maxDepth = 4;
- int maxSearchDepth = 100;
+ int maxSearchDepth = 10;
int i, j;
Work[] works;
QueryTask[] qt;
mid[1] = (128<<24)|(195<<16)|(136<<8)|163;
mid[2] = (128<<24)|(195<<16)|(136<<8)|164;
mid[3] = (128<<24)|(195<<16)|(136<<8)|165;
+ mid[4] = (128<<24)|(195<<16)|(136<<8)|166;
+ mid[5] = (128<<24)|(195<<16)|(136<<8)|167;
+ mid[6] = (128<<24)|(195<<16)|(136<<8)|168;
+ mid[7] = (128<<24)|(195<<16)|(136<<8)|169;
-
-/* mid[0] = (128<<24)|(195<<16)|(180<<8)|21;
- mid[1] = (128<<24)|(195<<16)|(180<<8)|24;
- mid[2] = (128<<24)|(195<<16)|(180<<8)|26;
-*/
atomic {
firstmachine = global new GlobalString(args[1]);
if (args.length == 3) {
function killclients {
i=1;
fileName=$1
- let "k= $Num";
- while [ $i -le $k ]; do
+ while [ $i -le $2 ]; do
echo "killing dc-$i ${fileName}"
ssh dc-${i} pkill -u jihoonl -f ${fileName}
i=`expr $i + 1`
ssh dc-${machine} pkill -u jihoonl -f ${fileName}
}
+# runmachines <log filename>
function runMachines {
echo "Running on ${NUM_MACHINE} machines ... "
echo "SSH into dc-${k}"
ssh dc-${k} 'cd '$DIR'; ./'$BM_NAME'.bin' &
k=`expr $k - 1`
+ sleep 1
done
-
echo "Running master machine ... "
- ssh dc-1 'cd '$DIR'; ./'$BM_NAME'.bin master '$NUM_MACHINE $BM_ARGS &
+ echo "ssh dc-1 cd $DIR'; ./$BM_NAME.bin master '$NUM_MACHINE $BM_ARGS";
+ ssh dc-1 'cd '$DIR'; ./'$BM_NAME'.bin master '$NUM_MACHINE $BM_ARGS
}
function runMultiMachineTest {
echo "Runnning ${BM_NAME}"
j=1;
BM_DIR=${BM_NAME}
-
- cd ${BM_DIR}
-
- while [ $j -le $ITERATIONS ]; do
- # run all machines
- runMachines
- sleep 10 # wait until all machine run
- fileName="$BM_NAME.bin";
- # Kill machines
- for k in 2 4 6 8
- do
- killonemachine $fileName $k
- sleep 30
- done
-
- sleep 1000; # wait the end of execution
- killclients # kill alive machines
- sleep 10;
- j=`expr $j + 1`
- done
+ fileName="$BM_NAME.bin";
+ cd ${BM_DIR}
+
+ ########### Normal execution
+ runMachines
+ killclients $fileName 8
+ sleep 10
+
+ ########### Failure case-1
+
+ # run all machines
+# runMachines
+# sleep 10 # wait until all machine run
+ # Kill machines
+# for k in 2 4 6 8
+# do
+# killonemachine $fileName $k
+# sleep 30
+# done
+
+# sleep 1000; # wait the end of execution
+ killclients $fileName 8 # kill alive machines
+ sleep 10;
cd -
}
projects / IRC.git / commitdiff