Benchmark update

Author: audictheprogrammer

src/data/Matrix_A.txt

@@ -4,3 +4,6 @@
 256 0.360843 
 512 3.050652 
 1024 27.503507 
+256 0.221791 
+512 1.843640 
+1024 16.366830 

src/data/Matrix_B.txt

@@ -1,3 +1,3 @@
-256 0.320855 
-512 2.779970 
-1024 25.977462 
+256 0.203090 
+512 1.740522 
+1024 15.488686 

src/data/Matrix_C.txt

@@ -1,3 +1,3 @@
-256 0.353629 
-512 2.799502 
-1024 24.423494 
+256 0.177558 
+512 1.571384 
+1024 14.695100 

src/data/Matrix_D.txt

@@ -1,3 +1,3 @@
-256 0.312455 
-512 2.680338 
-1024 24.309112 
+256 0.221454 
+512 1.564162 
+1024 14.567049 

src/data/Matrix_E.txt

@@ -1,3 +1,3 @@
-256 0.236347 
-512 2.194848 
-1024 20.595512 
+256 0.172510 
+512 1.320109 
+1024 10.923446 

src/data/Matrix_F.txt

@@ -26,7 +26,7 @@ int main(int argc, char** argv){
     const int TEST3 = 0;
     const int TEST4 = 1;
     const int TEST5 = 0;
-    // const int TEST6 = 0;
+    const int TEST6 = 0;
     // const int TEST7 = 1;
 
 
@@ -130,9 +130,9 @@ int main(int argc, char** argv){
         u_int32_t u_b = (int) (pow(2, 56) / p);  // Constant for Barrett
         fesetround(FE_TONEAREST);
 
-        int n = 1024;
+        int n = 512;
 
-        for (int i=0; i<1; i++){
+        for (int i=0; i<10; i++){
 
             double**A = random_matrix(n, p);
             double**B = random_matrix(n, p);
@@ -207,5 +207,13 @@ int main(int argc, char** argv){
         printf("res4 = %f \n", res4);
     }
 
+    if (TEST6){
+        printf("Hello world ! \n");
+    }
+
+
+
+
+
     return 0;
 }

src/data/Matrix_G.txt

@@ -7,7 +7,7 @@ double modulo_naive(double a, double p){
 
 double modulo_SIMD1(double a, double p, double u){
     /* Function .1 from SIMD article for floats.
-    Hypothesis: Rounding mode = down and p < 2^26.
+    Hypothesis: Rounding mode = nearest and p < 2^26.
     */
     double b = a * u;
     double c = (double)(int)b;
@@ -73,8 +73,8 @@ u_int32_t modulo_Barrett(u_int64_t a, u_int32_t p, u_int32_t u){
 void mp_naive(double** A, double** B, double** C, int n, double p){
     // Assert C is a zero matrix
     for (int i=0; i<n; i++){
-        for (int j=0; j<n; j++){
-            for (int k=0; k<n; k++){
+        for (int k=0; k<n; k++){
+            for (int j=0; j<n; j++){
                 double temp = modulo_naive(A[i][k] * B[k][j], p);
                 C[i][j] += temp;
             }
@@ -92,8 +92,8 @@ void mp_naive(double** A, double** B, double** C, int n, double p){
 void mp_SIMD1(double** A, double** B, double** C, int n, double p, double u){
     // Assert C is a zero matrix
     for (int i=0; i<n; i++){
-        for (int j=0; j<n; j++){
-            for (int k=0; k<n; k++){
+        for (int k=0; k<n; k++){
+            for (int j=0; j<n; j++){
                 double temp = modulo_SIMD1(A[i][k] * B[k][j], p, u);
                 C[i][j] += temp;
             }
@@ -111,8 +111,8 @@ void mp_SIMD1(double** A, double** B, double** C, int n, double p, double u){
 void mp_SIMD2(double** A, double** B, double** C, int n, double p, double u){
     // Assert C is a zero matrix
     for (int i=0; i<n; i++){
-        for (int j=0; j<n; j++){
-            for (int k=0; k<n; k++){
+        for (int k=0; k<n; k++){
+            for (int j=0; j<n; j++){
                 double temp = modulo_SIMD2(A[i][k] * B[k][j], p, u);
                 C[i][j] += temp;
             }
@@ -130,8 +130,8 @@ void mp_SIMD2(double** A, double** B, double** C, int n, double p, double u){
 void mp_SIMD3(double** A, double** B, double** C, int n, double p, double u){
     // Assert C is a zero matrix
     for (int i=0; i<n; i++){
-        for (int j=0; j<n; j++){
-            for (int k=0; k<n; k++){
+        for (int k=0; k<n; k++){
+            for (int j=0; j<n; j++){
                 double temp = modulo_SIMD3(A[i][k] * B[k][j], p, u);
                 C[i][j] += temp;
             }
@@ -150,8 +150,8 @@ void mp_SIMD3(double** A, double** B, double** C, int n, double p, double u){
 void mp_Barrett(double** A, double** B, double** C, int n, double p, u_int32_t u){
     // Assert C is a zero matrix
     for (int i=0; i<n; i++){
-        for (int j=0; j<n; j++){
-            for (int k=0; k<n; k++){
+        for (int k=0; k<n; k++){
+            for (int j=0; j<n; j++){
                 double temp = modulo_Barrett(A[i][k] * B[k][j], p, u);
                 C[i][j] += temp;
             }