-
Notifications
You must be signed in to change notification settings - Fork 0
/
bcast_random.c
287 lines (259 loc) · 8.15 KB
/
bcast_random.c
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
#include <mpi.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <cuda_runtime.h>
#include <cuda.h>
#include <stdint.h>
//#define DDT_TEST
#define CPU_TEST 0
void create_vector(int count, int blocklength, int stride, MPI_Datatype *vector)
{
int i, ierr;
ierr = MPI_Type_vector(count, blocklength, stride,
MPI_DOUBLE,
vector);
if (ierr != MPI_SUCCESS) {
printf("MPI_Type_vector() returned %d", ierr);
}
ierr = MPI_Type_commit (vector);
if (ierr != MPI_SUCCESS) {
printf("MPI_Type_commit() returned %d", ierr);
}
}
void fill_vectors(double* vp, int count, int blocklength, int stride)
{
int i, j;
for (i = 0; i < count-1; i++ ){
for (j = i*stride; j < (i+1)*stride; j++) {
if (j >= i*stride && j < i*stride+blocklength) {
vp[j] = 1.0;
} else {
vp[j] = 0.0;
}
}
}
for (i = (count-1)*stride; i < (count-1)*stride+blocklength; i++) {
vp[i] = 1.0;
}
}
void verify_vectors(double *vp, int count, int blocklength, int stride)
{
int i, j;
int error = 0;
for (i = 0; i < count-1; i++) {
for (j = i*stride; j < (i+1)*stride; j++) {
if (j >= i*stride && j < i*stride+blocklength) {
if (vp[j] != 1.0) {
error ++;
}
}
}
}
for (i = (count-1)*stride; i < (count-1)*stride+blocklength; i++) {
if (vp[i] != 1.0) {
error ++;
}
}
if (error != 0) {
printf("%d error is found\n", error);
} else {
printf("no error is found\n");
}
}
size_t compute_buffer_length(MPI_Datatype pdt, int count)
{
MPI_Aint extent, lb, true_extent, true_lb;
size_t length;
MPI_Type_get_extent(pdt, &lb, &extent);
MPI_Type_get_true_extent(pdt, &true_lb, &true_extent); (void)true_lb;
length = true_lb + true_extent + (count - 1) * extent;
return length;
}
int main(int argc, char** argv) {
int my_rank =0;
// Initialize the MPI environment
MPI_Init(NULL, NULL);
// Get the number of processes
int world_size;
MPI_Comm_size(MPI_COMM_WORLD, &world_size);
// Get the rank of the process
MPI_Comm_rank(MPI_COMM_WORLD, &my_rank);
// Get the name of the processor
char processor_name[MPI_MAX_PROCESSOR_NAME];
int name_len;
MPI_Get_processor_name(processor_name, &name_len);
printf("rank %d, pid %d\n", my_rank, getpid());
//sleep(10);
opterr = 0;
int c;
int j, k;
uint8_t char_val;
size_t length;
#if defined (DDT_TEST)
double *buffer_cuda = NULL;
double *buffer_host = NULL;
#else
char *buffer_cuda = NULL;
char *buffer_host = NULL;
char *buffer_bcast = NULL;
#endif
int root = 0;
MPI_Datatype root_type;
size_t root_size;
double t1, t2;
cudaError_t err;
while ((c = getopt (argc, argv, "l:")) != -1) {
switch (c) {
case 'l':
length = atoi(optarg);
break;
case '?':
if (optopt == 'l')
fprintf (stderr, "Option -%c requires an argument.\n", optopt);
else if (isprint (optopt))
fprintf (stderr, "Unknown option `-%c'.\n", optopt);
else
fprintf (stderr,"Unknown option character `\\x%x'.\n", optopt);
exit(1);
default:
exit(1);
}
}
// Print off a hello world message
printf("Hello world from processor %s, rank %d"
" out of %d processors, size %ld\n",
processor_name, my_rank, world_size, length);
CUcontext cuda_ctx[6];
/*
cuInit(0);
for (j = 0; j < world_size; j++) {
if (CUDA_SUCCESS != cuCtxCreate(&cuda_ctx[j], 0, j)) {
assert(0);
}
} */
/*
for (k = 0; k < world_size; k++) {
cudaSetDevice(k);
for (j = 0; j < world_size; j++) {
if (j != k) {
// err = cudaDeviceEnablePeerAccess(j, 0);
if (err != cudaSuccess && err != cudaErrorPeerAccessAlreadyEnabled) {
printf("peer access error\n");
exit(0);
}
}
}
}*/
cudaSetDevice(my_rank % 4 + 0);
int new_rank;
int new_size;
MPI_Comm new_comm;
// srand(my_rank);
int my_new_rank;
int node_id = my_rank / 4;
int rank_id = my_rank % 4;
my_new_rank = node_id + rank_id*3;
srand(my_rank + node_id + rank_id);
//MPI_Comm_split(MPI_COMM_WORLD, 0, my_new_rank, &new_comm);
MPI_Comm_split(MPI_COMM_WORLD, 0, rand()%12, &new_comm);
//MPI_Comm_split(MPI_COMM_WORLD, 0, (my_rank + 3 )%12, &new_comm);
MPI_Comm_rank(new_comm, &new_rank);
MPI_Comm_size(new_comm, &new_size);
my_rank = new_rank;
//cudaSetDevice(my_rank % 4 + 0);
#if defined (DDT_TEST)
create_vector(length, length, 2*length, &root_type);
root_size = compute_buffer_length(root_type, 1);
cudaMalloc((void **)&buffer_cuda, sizeof(double)*length*length*8);
cudaMallocHost((void **)&buffer_host, sizeof(double)*length*length*8);
MPI_Bcast(buffer_cuda, 2, root_type, root, MPI_COMM_WORLD);
cudaMemset(buffer_cuda, 0, sizeof(double)*length*length*4);
cudaDeviceSynchronize();
if (my_rank == 0) {
fill_vectors(buffer_host, length, length, 2*length);
cudaMemcpy(buffer_cuda, buffer_host, root_size, cudaMemcpyHostToDevice);
}
#else
cudaMalloc((void **)&buffer_cuda, sizeof(char)*length);
cudaMallocHost((void **)&buffer_host, sizeof(char)*length);
//buffer_host = malloc(sizeof(char)*length);
if (CPU_TEST) {
buffer_bcast = buffer_host;
} else {
buffer_bcast = buffer_cuda;
}
MPI_Bcast(buffer_bcast, length, MPI_CHAR, root, new_comm);
MPI_Bcast(buffer_bcast, length, MPI_CHAR, root, new_comm);
//MPI_Bcast(buffer_bcast, length, MPI_CHAR, root, MPI_COMM_WORLD);
//MPI_Barrier(MPI_COMM_WORLD);
cudaMemset(buffer_cuda, 0, sizeof(char)*length);
cudaDeviceSynchronize();
if (my_rank == root) {
for (j = 0; j < length; j++) {
buffer_host[j] = 97 + j%25;
}
cudaMemcpy(buffer_cuda, buffer_host, sizeof(char)*length, cudaMemcpyHostToDevice);
}
#endif
if (CPU_TEST) {
buffer_bcast = buffer_host;
} else {
buffer_bcast = buffer_cuda;
}
MPI_Barrier(new_comm);
if (my_rank == root) {
t1 = MPI_Wtime();
}
#if defined (DDT_TEST)
MPI_Bcast(buffer_cuda, 2, root_type, root, MPI_COMM_WORLD);
#else
int r;
// for (r = 0; r < world_size; r++) {
// root = r;
// if (my_rank == root) {
// for (j = 0; j < length; j++) {
// buffer_host[j] = 97 + j%25;
// }
// cudaMemcpy(buffer_cuda, buffer_host, sizeof(char)*length, cudaMemcpyHostToDevice);
// }
// MPI_Barrier(MPI_COMM_WORLD);
for (j = 0; j < 10; j++) {
MPI_Bcast(buffer_bcast, length, MPI_CHAR, root, new_comm);
MPI_Barrier(new_comm);
}
#endif
if (my_rank == root) {
t2 = MPI_Wtime();
printf("root send&recv time %fs, BW %f GB/s\n", (t2-t1)/10, length*sizeof(char)/1.0E9/(t2-t1)*10);
}
#if defined (DDT_TEST)
if (my_rank != 0) {
cudaMemcpy(buffer_host, buffer_cuda, root_size, cudaMemcpyDeviceToHost);
verify_vectors(buffer_host, length, length, 2*length);
}
#else
if (my_rank != root) {
if (!CPU_TEST) {
cudaMemcpy(buffer_host, buffer_cuda, sizeof(char)*length, cudaMemcpyDeviceToHost);
}
for (j = 0; j < length; j++) {
if (buffer_host[j] != (97 + j%25)) {
printf("error find , val %c\n", buffer_host[j]);
assert(0);
goto cleanup;
}
}
printf("no error is found\n");
}
#endif
// }
cleanup:
if (buffer_cuda != NULL) cudaFree(buffer_cuda);
// free(buffer_cuda);
// if (buffer_host != NULL) cudaFreeHost(buffer_host);
// Finalize the MPI environment.
MPI_Finalize();
}