-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathbenchmark_internal.cc
304 lines (270 loc) · 10.4 KB
/
benchmark_internal.cc
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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
/* Copyright 2018 Los Alamos National Laboratory
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
//#include "benchmark_internal.h"
#include "core.h"
#include "core_c.h"
#include <data_dist/matrix/two_dim_rectangle_cyclic.h>
#include "common.h"
#include <parsec/execution_stream.h>
#include <data_dist/matrix/two_dim_rectangle_cyclic.h>
#include <parsec/arena.h>
#include "benchmark_internal.h"
#define USE_CORE_VERIFICATION
#ifdef __cplusplus
extern "C"
{
int CORE_kernel(parsec_execution_stream_t *es, task_graph_t g, float *out, float *in1, float *in2, float *in3,
float *in4, float *in5, int num_args, int x, int t, int graph_idx, int my_rank, char **extra_local_memory)
{
TaskGraph graph(g);
switch(num_args){
case 1:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)out);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
//TODO
//task_graph_execute_point(graph, timestep, point, (char *)output_ptr, output_bytes, (const char **)inputPointer, inputBytes, numInputs);
#else
*out = 0.0;
printf("Graph %d, Task1, [%d, %d], rank %d, core %d, out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *out, extra_local_memory[es->core_id]);
#endif
break;
}
case 2:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)in1);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
#else
*out = *in1 + 1.0;
printf("Graph %d, Task2, [%d, %d], rank %d, core %d, in1 %.2f out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *in1, *out, extra_local_memory[es->core_id]);
#endif
break;
}
case 3:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)in1);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in2);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
#else
*out = *in1 + *in2 + 1.0;
printf("Graph %d, Task3, [%d, %d], rank %d, core %d, in1 %.2f, in2 %.2f, out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *in1, *in2, *out, extra_local_memory[es->core_id]);
#endif
break;
}
case 4:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)in1);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in2);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in3);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
#else
*out = *in1 + *in2 + *in3 + 1.0;
printf("Graph %d, Task4, [%d, %d], rank %d, core %d, in1 %.2f, in2 %.2f, in3 %.2f, out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *in1, *in2, *in3, *out, extra_local_memory[es->core_id]);
#endif
break;
}
case 5:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)in1);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in2);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in3);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in4);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
#else
*out = *in1 + *in2 + *in3 + *in4 + 1.0;
printf("Graph %d, Task5, [%d, %d], rank %d, core %d, in1 %.2f, in2 %.2f, in3 %.2f, in4 %.2f, out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *in1, *in2, *in3, *in4, *out, extra_local_memory[es->core_id]);
#endif
break;
}
case 6:
{
#if defined (USE_CORE_VERIFICATION)
char *output_ptr = (char*)out;
size_t output_bytes= graph.output_bytes_per_task;
std::vector<const char *> input_ptrs;
std::vector<size_t> input_bytes;
input_ptrs.push_back((char*)in1);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in2);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in3);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in4);
input_bytes.push_back(graph.output_bytes_per_task);
input_ptrs.push_back((char*)in5);
input_bytes.push_back(graph.output_bytes_per_task);
graph.execute_point(t, x, output_ptr, output_bytes,
input_ptrs.data(), input_bytes.data(), input_ptrs.size(), extra_local_memory[es->core_id], graph.scratch_bytes_per_task);
#else
*out = *in1 + *in2 + *in3 + *in4 + *in5 + 1.0;
printf("Graph %d, Task6, [%d, %d], rank %d, core %d, in1 %.2f, in2 %.2f, in3 %.2f, in4 %.2f, in5 %.2f, out %.2f, local_mem %p\n",
graph_idx, t, x, my_rank, es->core_id, *in1, *in2, *in3, *in4, *in5, *out, extra_local_memory[es->core_id]);
#endif
break;
}
default:
assert(false && "unexpected num_args");
}
#if defined (TRACK_NB_TASKS)
nb_tasks_per_node[es->core_id] ++;
#endif
return PARSEC_HOOK_RETURN_DONE;
}
int get_in_first(task_graph_t g, int t, int x) {
int in_first;
TaskGraph graph(g);
long dset = graph.dependence_set_at_timestep(t);
std::vector<std::pair<long, long> > deps = graph.dependencies(dset, x);
if (t == 0 || deps.size() == 0) {
in_first = -1;
} else {
long last_offset = graph.offset_at_timestep(t-1);
long last_width = graph.width_at_timestep(t-1);
for (int i = deps[0].first; i <= deps[0].second; i++) {
if (i >= last_offset && i < last_offset + last_width) {
in_first = i;
break;
}
}
}
// printf("(%d, %d): in_first: %d\n", t, x, in_first);
return in_first;
}
int get_in_last(task_graph_t g, int t, int x) {
int in_last;
TaskGraph graph(g);
long dset = graph.dependence_set_at_timestep(t);
std::vector<std::pair<long, long> > deps = graph.dependencies(dset, x);
if(t == 0 || 0 == deps.size()) {
in_last = -2;
} else {
long last_offset = graph.offset_at_timestep(t-1);
long last_width = graph.width_at_timestep(t-1);
for (int i = deps[0].second; i >= deps[0].first; i--) {
if (i >= last_offset && i < last_offset + last_width) {
in_last = i;
break;
}
}
}
//printf("(%d, %d): in_last: %d\n", t, x, in_last);
return in_last;
}
int get_out_first(task_graph_t g, int t, int x) {
int out_first;
TaskGraph graph(g);
long dset_r = graph.dependence_set_at_timestep(t+1);
std::vector<std::pair<long, long> > rdeps = graph.reverse_dependencies(dset_r, x);
if(0 == rdeps.size() || t == graph.timesteps -1) {
out_first = -1;
} else {
long next_offset = graph.offset_at_timestep(t+1);
long next_width = graph.width_at_timestep(t+1);
for (int i = rdeps[0].first; i <= rdeps[0].second; i++) {
if (i >= next_offset && i < next_offset + next_width) {
out_first = i;
break;
}
}
}
//printf("(%d, %d): out_first: %d\n", t, x, out_first);
return out_first;
}
int get_out_last(task_graph_t g, int t, int x) {
int out_last;
TaskGraph graph(g);
long dset_r = graph.dependence_set_at_timestep(t+1);
std::vector<std::pair<long, long> > rdeps = graph.reverse_dependencies(dset_r, x);
if(0 == rdeps.size() || t == graph.timesteps -1) {
out_last = -2;
} else {
long next_offset = graph.offset_at_timestep(t+1);
long next_width = graph.width_at_timestep(t+1);
for (int i = rdeps[0].second; i >= rdeps[0].first; i--) {
if (i >= next_offset && i < next_offset + next_width) {
out_last = i;
break;
}
}
}
// printf("(%d, %d): out_last: %d\n", t, x, out_last);
return out_last;
}
int get_num_args(task_graph_t g, int t, int x, int in_first, int in_last) {
TaskGraph graph(g);
long dset = graph.dependence_set_at_timestep(t);
std::vector<std::pair<long, long> > deps = graph.dependencies(dset, x);
if( 0 == deps.size() || 0 == t )
return 1;
else
return in_last - in_first + 2;
}
int get_num_args_out(task_graph_t g, int t, int x, int out_first, int out_last) {
TaskGraph graph(g);
long dset_r = graph.dependence_set_at_timestep(t+1);
std::vector<std::pair<long, long> > rdeps = graph.reverse_dependencies(dset_r, x);
if( 0 == rdeps.size() )
return 1;
else
return out_last - out_first + 2;
}
}
#endif /* end __cplusplus */