1 //**************************************************************************
2 // Multi-threaded Matrix Multiply benchmark
3 //--------------------------------------------------------------------------
4 // TA : Christopher Celio
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
14 // print out arrays, etc.
17 //--------------------------------------------------------------------------
25 //--------------------------------------------------------------------------
26 // Input/Reference Data
32 //--------------------------------------------------------------------------
33 // Basic Utilities and Multi-thread Support
35 __thread
unsigned long coreid
;
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(); \
45 _c += rdcycle(), _i += rdinstret(); \
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); \
52 //--------------------------------------------------------------------------
55 void printArray( char name
[], int n
, data_t arr
[] )
61 printf( " %10s :", name
);
62 for ( i
= 0; i
< n
; i
++ )
63 printf( " %3ld ", (long) arr
[i
] );
67 void __attribute__((noinline
)) verify(size_t n
, const data_t
* test
, const data_t
* correct
)
73 for (i
= 0; i
< n
; i
++)
75 if (test
[i
] != correct
[i
])
77 printf("FAILED test[%d]= %3ld, correct[%d]= %3ld\n",
78 i
, (long)test
[i
], i
, (long)correct
[i
]);
86 //--------------------------------------------------------------------------
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
[] )
97 for ( i
= 0; i
< lda
; i
++ )
98 for ( j
= 0; j
< lda
; j
++ )
100 for ( k
= 0; k
< lda
; k
++ )
102 C
[i
+ j
*lda
] += A
[j
*lda
+ k
] * B
[k
*lda
+ i
];
109 void __attribute__((noinline
)) matmul(const int lda
, const data_t A
[], const data_t B
[], data_t C
[] )
112 // ***************************** //
113 // **** ADD YOUR CODE HERE ***** //
114 // ***************************** //
116 // feel free to make a separate function for MI and MSI versions.
118 //----------MSI--------------
122 for(j = coreid*lda/ncores; j < coreid*lda/ncores + lda/ncores; j++) {
123 for(i = 0; i < lda; i+=4) {
128 for(k = 0; k < lda; k++) {
129 Cval0 += A[j*lda+k]*B[k*lda+i];
130 Cval1 += A[j*lda+k]*B[k*lda+i+1];
131 Cval2 += A[j*lda+k]*B[k*lda+i+2];
132 Cval3 += A[j*lda+k]*B[k*lda+i+3];
135 C[j*lda+i+1] = Cval1;
136 C[j*lda+i+2] = Cval2;
137 C[j*lda+i+3] = Cval3;
142 //------------------MI-------------------
146 for(j
= coreid
*lda
/ncores
; j
< coreid
*lda
/ncores
+ lda
/ncores
; j
++) {
147 for(i
= 0; i
< lda
; i
+=4) {
153 for(k
= 0; k
< lda
; k
++) {
154 Cval0
+= A
[j
*lda
+k
]*B
[k
*lda
+i
];
155 Cval1
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+1];
156 Cval2
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+2];
157 Cval3
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+3];
160 for(k
= lda
-1; k
>= 0; k
--) {
161 Cval0
+= A
[j
*lda
+k
]*B
[k
*lda
+i
];
162 Cval1
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+1];
163 Cval2
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+2];
164 Cval3
+= A
[j
*lda
+k
]*B
[k
*lda
+i
+3];
168 C
[j
*lda
+i
+1] = Cval1
;
169 C
[j
*lda
+i
+2] = Cval2
;
170 C
[j
*lda
+i
+3] = Cval3
;
175 //--------------------------------------------------------------------------
178 // all threads start executing thread_entry(). Use their "coreid" to
179 // differentiate between threads (each thread is running on a separate core).
181 void thread_entry(int cid
, int nc
)
186 // static allocates data in the binary, which is visible to both threads
187 static data_t results_data
[ARRAY_SIZE
];
190 // // Execute the provided, naive matmul
192 // stats(matmul_naive(DIM_SIZE, input1_data, input2_data, results_data); barrier());
196 // verify(ARRAY_SIZE, results_data, verify_data);
198 // // clear results from the first trial
201 // for (i=0; i < ARRAY_SIZE; i++)
202 // results_data[i] = 0;
206 // Execute your faster matmul
208 stats(matmul(DIM_SIZE
, input1_data
, input2_data
, results_data
); barrier());
211 printArray("results:", ARRAY_SIZE
, results_data
);
212 printArray("verify :", ARRAY_SIZE
, verify_data
);
216 verify(ARRAY_SIZE
, results_data
, verify_data
);