Matrix Size (n*n)
Processing Time (secs)
960
1.37
1024
1.73
2048
47.48
4096
319.64
Code on next page
import java.util.Random;
public class MatrixMultiply {
public static void main(String[] args) {
Random rand = new Random();
int n = Integer.parseInt(args[0]);
int[][] a = new int[n][n];
int[][] b = new int[n][n];
int[][] c = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = rand.nextInt(2);
b[i][j] = rand.nextInt(2);
}
}
for (int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
for(int k = 0; k < n; k++){
c[i][j] += a[i][k] * b[k][j];
}
}
}
}
}