-
Notifications
You must be signed in to change notification settings - Fork 0
/
parallel_odd_even.c
424 lines (367 loc) · 12.3 KB
/
parallel_odd_even.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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
/*
* File: parallel_odd_even.c
* Purpose: Implement parallel odd-even sort of an array of
* nonegative ints
* Input:
* A: elements of array (optional)
* Output:
* A: elements of A after sorting
*
* Compile: mpicc -g -Wall -o parallel_odd_even parallel_odd_even.c
* Run:
* mpiexec -n <p> parallel_odd_even <g|i> <global_n>
* - p: the number of processes
* - g: generate random, distributed list
* - i: user will input list on process 0
* - global_n: number of elements in global list
*
* Notes:
* 1. global_n must be evenly divisible by p
* 2. DEBUG flag prints original and final sublists
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <mpi.h>
// const int RMAX = 1000000000;
const int RMAX = 100;
/* Local functions */
void Usage(char* program);
void Print_list(int local_A[], int local_n, int rank);
void Merge_split_low(int local_A[], int temp_B[], int temp_C[],
int local_n);
void Merge_split_high(int local_A[], int temp_B[], int temp_C[],
int local_n);
void Generate_list(int local_A[], int local_n, int my_rank);
int Compare(const void* a_p, const void* b_p);
/* Functions involving communication */
void Get_args(int argc, char* argv[], int* global_n_p, int* local_n_p,
char* gi_p, int my_rank, int p, MPI_Comm comm);
void Sort(int local_A[], int local_n, int my_rank,
int p, MPI_Comm comm);
void Odd_even_iter(int local_A[], int temp_B[], int temp_C[],
int local_n, int phase, int even_partner, int odd_partner,
int my_rank, int p, MPI_Comm comm);
void Print_local_lists(int local_A[], int local_n,
int my_rank, int p, MPI_Comm comm);
void Print_global_list(int local_A[], int local_n, int my_rank,
int p, MPI_Comm comm);
void Read_list(int local_A[], int local_n, int my_rank, int p,
MPI_Comm comm);
/*-------------------------------------------------------------------*/
int main(int argc, char* argv[]) {
int my_rank, p;
char g_i;
int *local_A;
int global_n;
int local_n;
MPI_Comm comm;
double start, finish;
MPI_Init(&argc, &argv);
comm = MPI_COMM_WORLD;
MPI_Comm_size(comm, &p);
MPI_Comm_rank(comm, &my_rank);
Get_args(argc, argv, &global_n, &local_n, &g_i, my_rank, p, comm);
local_A = (int*) malloc(local_n*sizeof(int));
if (g_i == 'g') {
Generate_list(local_A, local_n, my_rank);
} else {
Read_list(local_A, local_n, my_rank, p, comm);
}
# ifdef DEBUG
Print_local_lists(local_A, local_n, my_rank, p, comm);
# endif
start = MPI_Wtime();
Sort(local_A, local_n, my_rank, p, comm);
finish = MPI_Wtime();
if (my_rank == 0)
printf("Elapsed time = %e seconds\n", finish-start);
# ifdef DEBUG
Print_local_lists(local_A, local_n, my_rank, p, comm);
fflush(stdout);
# endif
Print_global_list(local_A, local_n, my_rank, p, comm);
free(local_A);
MPI_Finalize();
return 0;
} /* main */
/*-------------------------------------------------------------------
* Function: Generate_list
* Purpose: Fill list with random ints
* Input Args: local_n, my_rank
* Output Arg: local_A
*/
void Generate_list(int local_A[], int local_n, int my_rank) {
int i;
srandom(my_rank+1);
for (i = 0; i < local_n; i++)
local_A[i] = random() % RMAX;
} /* Generate_list */
/*-------------------------------------------------------------------
* Function: Usage
* Purpose: Print command line to start program
* In arg: program: name of executable
* Note: Purely local, run only by process 0;
*/
void Usage(char* program) {
fprintf(stderr, "usage: mpirun -np <p> %s <g|i> <global_n>\n",
program);
fprintf(stderr, " - p: the number of processes \n");
fprintf(stderr, " - g: generate random, distributed list\n");
fprintf(stderr, " - i: user will input list on process 0\n");
fprintf(stderr, " - global_n: number of elements in global list");
fprintf(stderr, " (must be evenly divisible by p)\n");
fflush(stderr);
} /* Usage */
/*-------------------------------------------------------------------
* Function: Get_args
* Purpose: Get and check command line arguments
* Input args: argc, argv, my_rank, p, comm
* Output args: global_n_p, local_n_p, gi_p
*/
void Get_args(int argc, char* argv[], int* global_n_p, int* local_n_p,
char* gi_p, int my_rank, int p, MPI_Comm comm) {
if (my_rank == 0) {
if (argc != 3) {
Usage(argv[0]);
*global_n_p = -1; /* Bad args, quit */
} else {
*gi_p = argv[1][0];
if (*gi_p != 'g' && *gi_p != 'i') {
Usage(argv[0]);
*global_n_p = -1; /* Bad args, quit */
} else {
*global_n_p = strtol(argv[2], NULL, 10);
if (*global_n_p % p != 0) {
Usage(argv[0]);
*global_n_p = -1;
}
}
}
} /* my_rank == 0 */
MPI_Bcast(gi_p, 1, MPI_CHAR, 0, comm);
MPI_Bcast(global_n_p, 1, MPI_INT, 0, comm);
if (*global_n_p <= 0) {
MPI_Finalize();
exit(-1);
}
*local_n_p = *global_n_p/p;
} /* Get_args */
/*-------------------------------------------------------------------
* Function: Read_list
* Purpose: process 0 reads the list from stdin and scatters it
* to the other processes.
* In args: local_n, my_rank, p, comm
* Out arg: local_A
*/
void Read_list(int local_A[], int local_n, int my_rank, int p,
MPI_Comm comm) {
int i;
int *temp = NULL;
if (my_rank == 0) {
temp = (int*) malloc(p*local_n*sizeof(int));
printf("Enter the elements of the list\n");
for (i = 0; i < p*local_n; i++)
scanf("%d", &temp[i]);
}
MPI_Scatter(temp, local_n, MPI_INT, local_A, local_n, MPI_INT,
0, comm);
if (my_rank == 0)
free(temp);
} /* Read_list */
/*-------------------------------------------------------------------
* Function: Print_global_list
* Purpose: Print the contents of the global list A
* Input args:
* n, the number of elements
* A, the list
* Note: Purely local, called only by process 0
*/
void Print_global_list(int local_A[], int local_n, int my_rank, int p,
MPI_Comm comm) {
int* A = NULL;
int i, n;
if (my_rank == 0) {
n = p*local_n;
A = (int*) malloc(n*sizeof(int));
MPI_Gather(local_A, local_n, MPI_INT, A, local_n, MPI_INT, 0,
comm);
printf("Global list:\n");
for (i = 0; i < n; i++)
printf("%d ", A[i]);
printf("\n\n");
free(A);
} else {
MPI_Gather(local_A, local_n, MPI_INT, A, local_n, MPI_INT, 0,
comm);
}
} /* Print_global_list */
/*-------------------------------------------------------------------
* Function: Compare
* Purpose: Compare 2 ints, return -1, 0, or 1, respectively, when
* the first int is less than, equal, or greater than
* the second. Used by qsort.
*/
int Compare(const void* a_p, const void* b_p) {
int a = *((int*)a_p);
int b = *((int*)b_p);
if (a < b)
return -1;
else if (a == b)
return 0;
else /* a > b */
return 1;
} /* Compare */
/*-------------------------------------------------------------------
* Function: Sort
* Purpose: Use odd-even sort to sort global list.
* Input args: local_n, my_rank, p, comm
* In/out args: local_A
*/
void Sort(int local_A[], int local_n, int my_rank,
int p, MPI_Comm comm) {
int phase;
int *temp_B, *temp_C;
int even_partner; /* phase is even or left-looking */
int odd_partner; /* phase is odd or right-looking */
/* Temporary storage used in merge-split */
temp_B = (int*) malloc(local_n*sizeof(int));
temp_C = (int*) malloc(local_n*sizeof(int));
/* Find partners: negative rank => do nothing during phase */
if (my_rank % 2 != 0) {
even_partner = my_rank - 1;
odd_partner = my_rank + 1;
if (odd_partner == p) odd_partner = -1; // Idle during odd phase
} else {
even_partner = my_rank + 1;
if (even_partner == p) even_partner = -1; // Idle during even phase
odd_partner = my_rank-1;
}
/* Sort local list using built-in quick sort */
qsort(local_A, local_n, sizeof(int), Compare);
for (phase = 0; phase < p; phase++)
Odd_even_iter(local_A, temp_B, temp_C, local_n, phase,
even_partner, odd_partner, my_rank, p, comm);
free(temp_B);
free(temp_C);
} /* Sort */
/*-------------------------------------------------------------------
* Function: Odd_even_iter
* Purpose: One iteration of Odd-even transposition sort
* In args: local_n, phase, my_rank, p, comm
* In/out args: local_A
* Scratch: temp_B, temp_C
*/
void Odd_even_iter(int local_A[], int temp_B[], int temp_C[],
int local_n, int phase, int even_partner, int odd_partner,
int my_rank, int p, MPI_Comm comm) {
MPI_Status status;
if (phase % 2 == 0) { /* Even phase, odd process <-> rank-1 */
if (even_partner >= 0) {
MPI_Sendrecv(local_A, local_n, MPI_INT, even_partner, 0,
temp_B, local_n, MPI_INT, even_partner, 0, comm,
&status);
if (my_rank % 2 != 0)
Merge_split_high(local_A, temp_B, temp_C, local_n);
else
Merge_split_low(local_A, temp_B, temp_C, local_n);
}
} else { /* Odd phase, odd process <-> rank+1 */
if (odd_partner >= 0) {
MPI_Sendrecv(local_A, local_n, MPI_INT, odd_partner, 0,
temp_B, local_n, MPI_INT, odd_partner, 0, comm,
&status);
if (my_rank % 2 != 0)
Merge_split_low(local_A, temp_B, temp_C, local_n);
else
Merge_split_high(local_A, temp_B, temp_C, local_n);
}
}
} /* Odd_even_iter */
/*-------------------------------------------------------------------
* Function: Merge_split_low
* Purpose: Merge the smallest local_n elements in local_A
* and temp_B into temp_C. Then copy temp_C
* back into local_A.
* In args: local_n, temp_B
* In/out args: local_A
* Scratch: temp_C
*/
void Merge_split_low(int local_A[], int temp_B[], int temp_C[],
int local_n) {
int ai, bi, ci;
ai = 0;
bi = 0;
ci = 0;
while (ci < local_n) {
if (local_A[ai] <= temp_B[bi]) {
temp_C[ci] = local_A[ai];
ci++; ai++;
} else {
temp_C[ci] = temp_B[bi];
ci++; bi++;
}
}
memcpy(local_A, temp_C, local_n*sizeof(int));
} /* Merge_split_low */
/*-------------------------------------------------------------------
* Function: Merge_split_high
* Purpose: Merge the largest local_n elements in local_A
* and temp_B into temp_C. Then copy temp_C
* back into local_A.
* In args: local_n, temp_B
* In/out args: local_A
* Scratch: temp_C
*/
void Merge_split_high(int local_A[], int temp_B[], int temp_C[],
int local_n) {
int ai, bi, ci;
ai = local_n-1;
bi = local_n-1;
ci = local_n-1;
while (ci >= 0) {
if (local_A[ai] >= temp_B[bi]) {
temp_C[ci] = local_A[ai];
ci--; ai--;
} else {
temp_C[ci] = temp_B[bi];
ci--; bi--;
}
}
memcpy(local_A, temp_C, local_n*sizeof(int));
} /* Merge_split_low */
/*-------------------------------------------------------------------
* Only called by process 0
*/
void Print_list(int local_A[], int local_n, int rank) {
int i;
printf("%d: ", rank);
for (i = 0; i < local_n; i++)
printf("%d ", local_A[i]);
printf("\n");
} /* Print_list */
/*-------------------------------------------------------------------
* Function: Print_local_lists
* Purpose: Print each process' current list contents
* Input args: all
* Notes:
* 1. Assumes all participating processes are contributing local_n
* elements
*/
void Print_local_lists(int local_A[], int local_n,
int my_rank, int p, MPI_Comm comm) {
int* A;
int q;
MPI_Status status;
if (my_rank == 0) {
A = (int*) malloc(local_n*sizeof(int));
Print_list(local_A, local_n, my_rank);
for (q = 1; q < p; q++) {
MPI_Recv(A, local_n, MPI_INT, q, 0, comm, &status);
Print_list(A, local_n, q);
}
free(A);
} else {
MPI_Send(local_A, local_n, MPI_INT, 0, 0, comm);
}
} /* Print_local_lists */