1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
//**************************************************************************
// Multi-threaded Matrix Multiply benchmark
//--------------------------------------------------------------------------
// TA : Christopher Celio
// Student:
//
//
// This benchmark multiplies two 2-D arrays together and writes the results to
// a third vector. The input data (and reference data) should be generated
// using the matmul_gendata.pl perl script and dumped to a file named
// dataset.h.
// print out arrays, etc.
//#define DEBUG
//--------------------------------------------------------------------------
// Includes
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
//--------------------------------------------------------------------------
// Input/Reference Data
typedef float data_t;
#include "dataset.h"
//--------------------------------------------------------------------------
// Basic Utilities and Multi-thread Support
__thread unsigned long coreid;
unsigned long ncores;
#include "util.h"
#define stringify_1(s) #s
#define stringify(s) stringify_1(s)
#define stats(code) do { \
unsigned long _c = -rdcycle(), _i = -rdinstret(); \
code; \
_c += rdcycle(), _i += rdinstret(); \
if (coreid == 0) \
printf("%s: %ld cycles, %ld.%ld cycles/iter, %ld.%ld CPI\n", \
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); \
} while(0)
//--------------------------------------------------------------------------
// Helper functions
void printArray( char name[], int n, data_t arr[] )
{
int i;
if (coreid != 0)
return;
printf( " %10s :", name );
for ( i = 0; i < n; i++ )
printf( " %3ld ", (long) arr[i] );
printf( "\n" );
}
void __attribute__((noinline)) verify(size_t n, const data_t* test, const data_t* correct)
{
if (coreid != 0)
return;
size_t i;
for (i = 0; i < n; i++)
{
if (test[i] != correct[i])
{
printf("FAILED test[%d]= %3ld, correct[%d]= %3ld\n",
i, (long)test[i], i, (long)correct[i]);
exit(-1);
}
}
return;
}
//--------------------------------------------------------------------------
// matmul function
// single-thread, naive version
void __attribute__((noinline)) matmul_naive(const int lda, const data_t A[], const data_t B[], data_t C[] )
{
int i, j, k;
if (coreid > 0)
return;
for ( i = 0; i < lda; i++ )
for ( j = 0; j < lda; j++ )
{
for ( k = 0; k < lda; k++ )
{
C[i + j*lda] += A[j*lda + k] * B[k*lda + i];
}
}
}
void __attribute__((noinline)) matmul(const int lda, const data_t A[], const data_t B[], data_t C[] )
{
/*size_t i;
size_t j;
size_t k;
size_t max_dim = 32*32;
data_t temp_mat[32]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
for (i=coreid*max_dim/ncores; i<(max_dim/ncores+coreid*max_dim/ncores); i+=8){
data_t element=A[i];
data_t element2 = A[i+1];
data_t element3 = A[i+2];
data_t element4 = A[i+3];
data_t element5 = A[i+4];
data_t element6 = A[i+5];
data_t element7 = A[i+6];
data_t element8 = A[i+7];
int row= (int)(i/32)*32;
int column = i%32*32;
int column2 = (i+1)%32*32;
int column3 = (i+2)%32*32;
int column4 = (i+3)%32*32;
int column5 = (i+4)%32*32;
int column6 = (i+5)%32*32;
int column7 = (i+6)%32*32;
int column8 = (i+7)%32*32;
for (j=0; j<32; j++){
temp_mat[j]+=element*B[column+j]+element2*B[column2+j]+element3*B[column3+j]+element4*B[column4+j]+element5*B[column5+j]+element6*B[column6+j]+element7*B[column7+j]+element8*B[column8+j];
}
if (i%32==24){
for(k=0; k<32; k++){
C[row+k]=temp_mat[k];
temp_mat[k]=0;
}
}
}*/
int i,j,k,l;
//data_t element11, element12, element13, element14, element21, element22, element23, element24;
data_t element1, element2, element3, element4, element5, element6, element7, element8;
int row, row2;
//int column11, column12, column13, column14, column21, column22, column23, column24;
int column1, column2, column3, column4, column5, column6, column7, column8;
data_t temp[32]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
//data_t temp2[32]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
if (coreid == 0){
for (i=0; i<32; i++){
if (i==15){
for (j=0; j<32; j+=4){
row=15*32;
element1 = A[row+j];
element2 = A[row+j+1];
element3 = A[row+j+2];
element4 = A[row+j+3];
column1 = j*32;
column2 = (j+1)*32;
column3 = (j+2)*32;
column4 = (j+3)*32;
for (k=0;k<32; k++){
temp[k]+=element1*B[column1+k]+element2*B[column2+k]+element3*B[column3+k]+element4*B[column4+k];
}
if (j==28){
for (l=0; l<32; l++){
C[row+l]=temp[l];
temp[l]=0;
}
}
}
}
else{
row = i*32;
for (j=0; j<16; j+=4){
element1 = A[i*32+j];
element2 = A[i*32+j+1];
element3 = A[i*32+j+2];
element4 = A[i*32+j+3];
column1 = j*32;
column2 = (j+1)*32;
column3 = (j+2)*32;
column4 = (j+3)*32;
for (k=0; k<32; k++){
temp[k]+=element1*B[column1+k]+element2*B[column2+k]+element3*B[column3+k]+element4*B[column4+k];
}
if (j==12){
for (l=0; l<32; l++){
C[row+l]+=temp[l];
temp[l]=0;
}
}
}
}
}
}
else if (coreid==1){
for (i=0; i<32; i++){
row = (31-i)*32;
if (row/32 != 15){
for (j=16; j<32; j+=4){
element1 = A[(31-i)*32+j];
element2 = A[(31-i)*32+j+1];
element3 = A[(31-i)*32+j+2];
element4 = A[(31-i)*32+j+3];
column1 = j*32;
column2 = (j+1)*32;
column3 = (j+2)*32;
column4 = (j+3)*32;
for (k=0; k<32; k++){
temp[k]+=element1*B[column1+k]+element2*B[column2+k]+element3*B[column3+k]+element4*B[column4+k];
}
if (j==28){
for (l=0; l<32; l++){
C[row+l]+=temp[l];
temp[l]=0;
}
}
}
}
}
}
// ***************************** //
// **** ADD YOUR CODE HERE ***** //
// ***************************** //
//
// feel free to make a separate function for MI and MSI versions.
}
//--------------------------------------------------------------------------
// Main
//
// all threads start executing thread_entry(). Use their "coreid" to
// differentiate between threads (each thread is running on a separate core).
void thread_entry(int cid, int nc)
{
coreid = cid;
ncores = nc;
// static allocates data in the binary, which is visible to both threads
static data_t results_data[ARRAY_SIZE];
// Execute the provided, naive matmul
barrier();
stats(matmul_naive(DIM_SIZE, input1_data, input2_data, results_data); barrier());
// verify
verify(ARRAY_SIZE, results_data, verify_data);
// clear results from the first trial
size_t i;
if (coreid == 0)
for (i=0; i < ARRAY_SIZE; i++)
results_data[i] = 0;
barrier();
// Execute your faster matmul
barrier();
stats(matmul(DIM_SIZE, input1_data, input2_data, results_data); barrier());
#ifdef DEBUG
printArray("results:", ARRAY_SIZE, results_data);
printArray("verify :", ARRAY_SIZE, verify_data);
#endif
// verify
verify(ARRAY_SIZE, results_data, verify_data);
barrier();
exit(0);
}
|
