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
|
/*
* Copyright (c) 2016 University of Cordoba and University of Illinois
* All rights reserved.
*
* Developed by: IMPACT Research Group
* University of Cordoba and University of Illinois
* http://impact.crhc.illinois.edu/
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* with the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* > Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimers.
* > Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimers in the
* documentation and/or other materials provided with the distribution.
* > Neither the names of IMPACT Research Group, University of Cordoba,
* University of Illinois nor the names of its contributors may be used
* to endorse or promote products derived from this Software without
* specific prior written permission.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* CONTRIBUTORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS WITH
* THE SOFTWARE.
*
*/
#include "support/setup.h"
#include "kernel.h"
#include "support/common.h"
#include "support/timer.h"
#include "support/verify.h"
#include <unistd.h>
#include <thread>
#include <string.h>
#include <assert.h>
// Params ---------------------------------------------------------------------
struct Params {
int n_threads;
int n_warmup;
int n_reps;
int M_;
int m;
int N_;
int n;
Params(int argc, char **argv) {
n_threads = 4;
n_warmup = 5;
n_reps = 50;
M_ = 128;
m = 16;
N_ = 128;
n = 8;
int opt;
while((opt = getopt(argc, argv, "ht:w:r:m:n:o:p:")) >= 0) {
switch(opt) {
case 'h':
usage();
exit(0);
break;
case 't': n_threads = atoi(optarg); break;
case 'w': n_warmup = atoi(optarg); break;
case 'r': n_reps = atoi(optarg); break;
case 'm': m = atoi(optarg); break;
case 'n': n = atoi(optarg); break;
case 'o': M_ = atoi(optarg); break;
case 'p': N_ = atoi(optarg); break;
default:
fprintf(stderr, "\nUnrecognized option!\n");
usage();
exit(0);
}
}
}
void usage() {
fprintf(stderr,
"\nUsage: ./trns [options]"
"\n"
"\nGeneral options:"
"\n -h help"
"\n -t <T> # of host threads (default=4)"
"\n -w <W> # of untimed warmup iterations (default=5)"
"\n -r <R> # of timed repetition iterations (default=50)"
"\n"
"\nData-partitioning-specific options:"
"\n TRNS only supports CPU-only or GPU-only execution"
"\n"
"\nBenchmark-specific options:"
"\n -m <I> m (default=16 elements)"
"\n -n <I> n (default=8 elements)"
"\n -o <I> M_ (default=128 elements)"
"\n -p <I> N_ (default=128 elements)"
"\n");
}
};
// Input Data -----------------------------------------------------------------
void read_input(T *x_vector, const Params &p) {
int in_size = p.M_ * p.m * p.N_ * p.n;
srand(5432);
for(int i = 0; i < in_size; i++) {
x_vector[i] = ((T)(rand() % 100) / 100);
}
}
// Main ------------------------------------------------------------------------------------------
int main(int argc, char **argv) {
const Params p(argc, argv);
Timer timer;
// Allocate
timer.start("Allocation");
int M_ = p.M_;
int m = p.m;
int N_ = p.N_;
int n = p.n;
int in_size = M_ * m * N_ * n;
int finished_size = M_ * m * N_;
T * h_in_out = (T *)malloc(in_size * sizeof(T));
std::atomic_int *h_finished =
(std::atomic_int *)malloc(sizeof(std::atomic_int) * finished_size);
std::atomic_int *h_head = (std::atomic_int *)malloc(N_ * sizeof(std::atomic_int));
ALLOC_ERR(h_in_out, h_finished, h_head);
T *h_in_backup = (T *)malloc(in_size * sizeof(T));
ALLOC_ERR(h_in_backup);
timer.stop("Allocation");
timer.print("Allocation", 1);
// Initialize
timer.start("Initialization");
read_input(h_in_out, p);
memset((void *)h_finished, 0, sizeof(std::atomic_int) * finished_size);
for(int i = 0; i < N_; i++)
h_head[i].store(0);
timer.stop("Initialization");
timer.print("Initialization", 1);
memcpy(h_in_backup, h_in_out, in_size * sizeof(T)); // Backup for reuse across iterations
// Loop over main kernel
for(int rep = 0; rep < p.n_warmup + p.n_reps; rep++) {
// Reset
memcpy(h_in_out, h_in_backup, in_size * sizeof(T));
memset((void *)h_finished, 0, sizeof(std::atomic_int) * finished_size);
for(int i = 0; i < N_; i++)
h_head[i].store(0);
// start timer
if(rep >= p.n_warmup)
timer.start("Step 1");
// Launch CPU threads
std::thread main_thread_1(run_cpu_threads_100, h_in_out, h_finished, h_head, M_ * m, N_, n, p.n_threads); //M_ * m * N_);
main_thread_1.join();
// end timer
if(rep >= p.n_warmup)
timer.stop("Step 1");
for(int i = 0; i < N_; i++)
h_head[i].store(0);
// start timer
if(rep >= p.n_warmup)
timer.start("Step 2");
// Launch CPU threads
std::thread main_thread_2(run_cpu_threads_010, h_in_out, h_head, m, n, M_ * N_, p.n_threads);
main_thread_2.join();
// end timer
if(rep >= p.n_warmup)
timer.stop("Step 2");
memset((void *)h_finished, 0, sizeof(std::atomic_int) * finished_size);
for(int i = 0; i < N_; i++)
h_head[i].store(0);
// start timer
if(rep >= p.n_warmup)
timer.start("Step 3");
// Launch CPU threads
for(int i = 0; i < N_; i++){
std::thread main_thread_3(run_cpu_threads_100, h_in_out + i * M_ * n * m, h_finished + i * M_ * n, h_head + i, M_, n, m, p.n_threads); //M_ * n);
main_thread_3.join();
}
// end timer
if(rep >= p.n_warmup)
timer.stop("Step 3");
}
timer.print("Step 1", p.n_reps);
timer.print("Step 2", p.n_reps);
timer.print("Step 3", p.n_reps);
// Verify answer
//verify(h_in_out, h_in_backup, M_ * m, N_ * n, 1);
// Free memory
timer.start("Deallocation");
free(h_in_out);
free(h_finished);
free(h_head);
free(h_in_backup);
timer.stop("Deallocation");
timer.print("Deallocation", 1);
printf("Test Passed\n");
return 0;
}
|
