mt/aq_matmul/matmul_mi.c

   1 //**************************************************************************
   2 // Multi-threaded Matrix Multiply benchmark
   3 //--------------------------------------------------------------------------
   4 // TA     : Christopher Celio
   5 // Student:
   6 //
   7 //
   8 // This benchmark multiplies two 2-D arrays together and writes the results to
   9 // a third vector. The input data (and reference data) should be generated
  10 // using the matmul_gendata.pl perl script and dumped to a file named
  11 // dataset.h.
  12
  13
  14 // print out arrays, etc.
  15 //#define DEBUG
  16
  17 //--------------------------------------------------------------------------
  18 // Includes
  19
  20 #include <string.h>
  21 #include <stdlib.h>
  22 #include <stdio.h>
  23
  24
  25 //--------------------------------------------------------------------------
  26 // Input/Reference Data
  27
  28 typedef float data_t;
  29 #include "dataset.h"
  30
  31
  32 //--------------------------------------------------------------------------
  33 // Basic Utilities and Multi-thread Support
  34
  35 __thread unsigned long coreid;
  36 unsigned long ncores;
  37
  38 #include "util.h"
  39
  40 #define stringify_1(s) #s
  41 #define stringify(s) stringify_1(s)
  42 #define stats(code) do { \
  43     unsigned long _c = -rdcycle(), _i = -rdinstret(); \
  44     code; \
  45     _c += rdcycle(), _i += rdinstret(); \
  46     if (coreid == 0) \
  47       printf("%s: %ld cycles, %ld.%ld cycles/iter, %ld.%ld CPI\n", \
  48              stringify(code), _c, _c/DIM_SIZE/DIM_SIZE/DIM_SIZE, 10*_c/DIM_SIZE/DIM_SIZE/DIM_SIZE%10, _c/_i, 10*_c/_i%10); \
  49   } while(0)
  50
  51
  52 //--------------------------------------------------------------------------
  53 // Helper functions
  54
  55 void printArray( char name[], int n, data_t arr[] )
  56 {
  57    int i;
  58    if (coreid != 0)
  59       return;
  60
  61    printf( " %10s :", name );
  62    for ( i = 0; i < n; i++ )
  63       printf( " %3ld ", (long) arr[i] );
  64    printf( "\n" );
  65 }
  66
  67 void __attribute__((noinline)) verify(size_t n, const data_t* test, const data_t* correct)
  68 {
  69    if (coreid != 0)
  70       return;
  71
  72    size_t i;
  73    for (i = 0; i < n; i++)
  74    {
  75       if (test[i] != correct[i])
  76       {
  77          printf("FAILED test[%d]= %3ld, correct[%d]= %3ld\n",
  78             i, (long)test[i], i, (long)correct[i]);
  79          exit(-1);
  80       }
  81    }
  82
  83    return;
  84 }
  85
  86 //--------------------------------------------------------------------------
  87 // matmul function
  88
  89 // single-thread, naive version
  90 void __attribute__((noinline)) matmul_naive(const int lda,  const data_t A[], const data_t B[], data_t C[] )
  91 {
  92    int i, j, k;
  93
  94    if (coreid > 0)
  95       return;
  96
  97    for ( i = 0; i < lda; i++ )
  98       for ( j = 0; j < lda; j++ )
  99       {
 100          for ( k = 0; k < lda; k++ )
 101          {
 102             C[i + j*lda] += A[j*lda + k] * B[k*lda + i];
 103          }
 104       }
 105
 106 }
 107
 108
 109
 110 void __attribute__((noinline)) matmul(const int lda,  const data_t A[], const data_t B[], data_t C[] )
 111 {
 112
 113    // ***************************** //
 114    // **** ADD YOUR CODE HERE ***** //
 115    // ***************************** //
 116    //
 117    // feel free to make a separate function for MI and MSI versions.
 118
 119         for (int  i = coreid; i < lda; i+=ncores)
 120         {
 121                 for (int j = 0; j < lda; j++)
 122                 {
 123                         for (int k = 0; k < lda; k++)
 124                         {
 125                                 //int A12 = A[j*lda + k];
 126                                 //int B1 = B[k*lda + i];
 127                                 //int B2 = B[k*lda + i + ncores];
 128                                 //C[i+j*lda] += A12 * B1;
 129                                 //C[i+ncores+j*lda] += A12 * B2;
 130                                 C[i+j*lda] += A[j*lda +k] * B[k*lda +i];
 131                         }
 132                 }
 133         }
 134 }
 135
 136
 137 //--------------------------------------------------------------------------
 138 // Main
 139 //
 140 // all threads start executing thread_entry(). Use their "coreid" to
 141 // differentiate between threads (each thread is running on a separate core).
 142
 143 void thread_entry(int cid, int nc)
 144 {
 145    coreid = cid;
 146    ncores = nc;
 147
 148    // static allocates data in the binary, which is visible to both threads
 149    static data_t results_data[ARRAY_SIZE];
 150
 151
 152 //   // Execute the provided, naive matmul
 153 //   barrier();
 154 //   stats(matmul_naive(DIM_SIZE, input1_data, input2_data, results_data); barrier());
 155 //
 156 //
 157 //   // verify
 158 //   verify(ARRAY_SIZE, results_data, verify_data);
 159 //
 160 //   // clear results from the first trial
 161 //   size_t i;
 162 //   if (coreid == 0)
 163 //      for (i=0; i < ARRAY_SIZE; i++)
 164 //         results_data[i] = 0;
 165 //   barrier();
 166
 167
 168    // Execute your faster matmul
 169    barrier();
 170    stats(matmul(DIM_SIZE, input1_data, input2_data, results_data); barrier());
 171
 172 #ifdef DEBUG
 173    printArray("results:", ARRAY_SIZE, results_data);
 174    printArray("verify :", ARRAY_SIZE, verify_data);
 175 #endif
 176
 177    // verify
 178    verify(ARRAY_SIZE, results_data, verify_data);
 179    barrier();
 180
 181    exit(0);
 182 }
 183