1 //**************************************************************************
2 // Vector-vector add benchmark
3 //--------------------------------------------------------------------------
4 // Author : Andrew Waterman
5 // TA : Christopher Celio
8 // This benchmark adds two vectors and writes the results to a
9 // third vector. The input data (and reference data) should be
10 // generated using the vvadd_gendata.pl perl script and dumped
11 // to a file named dataset.h
13 // to print out arrays, etc.
16 //--------------------------------------------------------------------------
24 //--------------------------------------------------------------------------
25 // Input/Reference Data
31 //--------------------------------------------------------------------------
32 // Basic Utilities and Multi-thread Support
34 __thread
unsigned long coreid
;
39 #define stringify_1(s) #s
40 #define stringify(s) stringify_1(s)
41 #define stats(code) do { \
42 unsigned long _c = -rdcycle(), _i = -rdinstret(); \
44 _c += rdcycle(), _i += rdinstret(); \
46 printf("%s: %ld cycles, %ld.%ld cycles/iter, %ld.%ld CPI\n", \
47 stringify(code), _c, _c/DATA_SIZE, 10*_c/DATA_SIZE%10, _c/_i, 10*_c/_i%10); \
51 //--------------------------------------------------------------------------
54 void printArrayMT( char name
[], int n
, data_t arr
[] )
60 printf( " %10s :", name
);
61 for ( i
= 0; i
< n
; i
++ )
62 printf( " %4ld ", (long) arr
[i
] );
66 void __attribute__((noinline
)) verifyMT(size_t n
, const data_t
* test
, const data_t
* correct
)
72 for (i
= 0; i
< n
; i
++)
74 if (test
[i
] != correct
[i
])
76 printf("FAILED test[%d]= %4ld, correct[%d]= %4ld\n",
77 i
, (long) test
[i
], i
, (long)correct
[i
]);
85 //--------------------------------------------------------------------------
88 //perform in-place vvadd
89 void __attribute__((noinline
)) vvadd(size_t n
, data_t
* __restrict__ x
, const data_t
* __restrict__ y
)
93 // interleave accesses
94 for (i
= coreid
; i
< n
; i
+=ncores
)
100 void __attribute__((noinline
)) vvadd_opt(size_t n
, data_t
* __restrict__ x
, const data_t
* __restrict__ y
)
102 // ***************************** //
103 // **** ADD YOUR CODE HERE ***** //
104 // ***************************** //
107 size_t space
=n
/ncores
;
108 size_t max
= space
*coreid
+space
;
109 if (coreid
!=ncores
-1){
110 for (i
=space
*coreid
;i
<max
;i
+=1)
116 for(i
=space
*coreid
;i
<n
;i
+=1)
123 size_t space=n/ncores;
124 size_t max= space*coreid+space;
129 for (i=space*coreid;i<max&& i<n;i+=1)
136 //--------------------------------------------------------------------------
139 // all threads start executing thread_entry(). Use their "coreid" to
140 // differentiate between threads (each thread is running on a separate core).
142 void thread_entry(int cid
, int nc
)
147 // static allocates data in the binary, which is visible to both threads
148 static data_t results_data
[DATA_SIZE
];
150 // because we're going to perform an in-place vvadd (and we're going to run
151 // it a couple of times) let's copy the input data to a temporary results
157 for (i
= 0; i
< DATA_SIZE
; i
++)
158 results_data
[i
] = input1_data
[i
];
162 // Execute the provided, terrible vvadd
164 stats(vvadd(DATA_SIZE
, results_data
, input2_data
); barrier(nc
));
168 verifyMT(DATA_SIZE
, results_data
, verify_data
);
170 // reset results from the first trial
173 for (i
=0; i
< DATA_SIZE
; i
++)
174 results_data
[i
] = input1_data
[i
];
179 // Execute your faster vvadd
181 stats(vvadd_opt(DATA_SIZE
, results_data
, input2_data
); barrier(nc
));
184 printArrayMT("results: ", DATA_SIZE
, results_data
);
185 printArrayMT("verify : ", DATA_SIZE
, verify_data
);
189 verifyMT(DATA_SIZE
, results_data
, verify_data
);