Repository navigation
Expand file tree
/
Copy pathlu.c
More file actions
311 lines (270 loc) · 8.25 KB
/
Copy pathlu.c
File metadata and controls
311 lines (270 loc) · 8.25 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <mpi.h>
#ifndef N
#define N 2240
#endif
#ifndef NPROCS
#define NPROCS 224
#endif
#ifndef ITER_NUM
#define ITER_NUM 6
#endif
#define MATRIX 1
#define EPS 2.220446e-16
double A[N][N];
double b[N];
double x[N];
double c[N];
int perm[N]; // pivoting permutation array
int myid, numprocs;
void MyLUsolve(double A[N][N], double b[N], double x[N], int n);
int main(int argc, char* argv[]) {
double t0, t1, t2, t_w, t_avg;
double dc_inv, d_mflops, dtemp, dtemp2, dtemp_t;
int ierr;
int i, j;
int ii;
int ib;
int iter;
ierr = MPI_Init(&argc, &argv);
ierr = MPI_Comm_rank(MPI_COMM_WORLD, &myid);
ierr = MPI_Comm_size(MPI_COMM_WORLD, &numprocs);
/* Start of LU routine with iterations ----------------------------*/
t_avg = 0.0;
for (iter = 0; iter < ITER_NUM; iter++)
{
/* matrix generation --------------------------*/
if (MATRIX == 1) {
for(j=0; j<N; j++) {
ii = 0;
for(i=j; i<N; i++) {
A[j][i] = (N-j) - ii;
A[i][j] = A[j][i];
ii++;
}
}
} else {
srand(1);
dc_inv = 1.0/(double)RAND_MAX;
for(j=0; j<N; j++) {
for(i=0; i<N; i++) {
A[j][i] = rand()*dc_inv;
}
}
} /* end of matrix generation -------------------------- */
/* set vector b -------------------------- */
for (i=0; i<N; i++) {
b[i] = 0.0;
for (j=0; j<N; j++) {
b[i] += A[i][j];
}
}
/* ----------------------------------------------------- */
ierr = MPI_Barrier(MPI_COMM_WORLD);
t1 = MPI_Wtime();
MyLUsolve(A, b, x, N);
//ierr = MPI_Barrier(MPI_COMM_WORLD);
t2 = MPI_Wtime();
t0 = t2 - t1;
ierr = MPI_Reduce(&t0, &t_w, 1, MPI_DOUBLE, MPI_MAX, 0, MPI_COMM_WORLD);
if (myid == 0) {
printf("Iteration %d: LU solve time = %lf [sec.] \n", iter + 1, t_w);
if (iter > 0)
t_avg += t_w;
}
}
/* End of LU routine --------------------------- */
if (myid == 0) {
t_avg /= (ITER_NUM - 1);
printf("========================== \n");
printf("N = %d \n",N);
printf("Average LU solve time (%d runs) = %lf [sec.] \n", ITER_NUM - 1, t_avg);
d_mflops = 2.0/3.0*(double)N*(double)N*(double)N;
d_mflops += 7.0/2.0*(double)N*(double)N;
d_mflops += 4.0/3.0*(double)N;
d_mflops = d_mflops/t_avg;
d_mflops = d_mflops * 1.0e-6;
printf(" %lf [MFLOPS] \n", d_mflops);
}
/* Verification routine ----------------- */
ib = N / NPROCS;
dtemp_t = 0.0;
for(j=myid*ib; j<(myid+1)*ib; j++) {
dtemp2 = x[j] - 1.0;
dtemp_t += dtemp2*dtemp2;
}
dtemp_t = sqrt(dtemp_t);
/* -------------------------------------- */
MPI_Reduce(&dtemp_t, &dtemp, 1, MPI_DOUBLE, MPI_SUM, 0, MPI_COMM_WORLD);
/* Do not modify follows. -------- */
if (myid == 0) {
if (MATRIX == 1) dtemp2 = (double)N*(double)N*(double)N;
else dtemp2 = (double)N*(double)N;
dtemp_t = EPS*(double)N*dtemp2;
printf("Pass value: %e \n", dtemp_t);
printf("Calculated value: %e \n", dtemp);
if (dtemp > dtemp_t) {
printf("Error! Test is falled. \n");
exit(1);
}
printf(" OK! Test is passed. \n");
}
/* ----------------------------------------- */
ierr = MPI_Finalize();
exit(0);
}
void MyLUsolve(double A[N][N], double b[N], double x[N], int n)
{
int i, j, k;
double dtemp;
int ib, j_start, j_end, diag;
double buf[N];
MPI_Status status;
ib = n / numprocs;
j_start = myid * ib;
j_end = (myid + 1) * ib;
for (i = 0; i < n; i++) {
perm[i] = i;
}
for (k = 0; k < n; k++)
{
diag = k / ib;
int pivot_row = k;
/* Only the owner of column k finds pivot row */
if (diag == myid)
{
double max_val = fabs(A[k][k]);
for (i = k + 1; i < n; i++) {
if (fabs(A[i][k]) > max_val) {
max_val = fabs(A[i][k]);
pivot_row = i;
}
}
/* Send pivot_row to other processes */
for (j = diag + 1; j < numprocs; j++)
{
MPI_Send(&pivot_row, 1, MPI_INT, j, 1, MPI_COMM_WORLD);
}
}
else if (diag < myid)
{
/* Receive pivot_row */
MPI_Recv(&pivot_row, 1, MPI_INT, diag, 1, MPI_COMM_WORLD, &status);
}
/* All processes perform row swap locally */
if (pivot_row != k) {
for (j = 0; j < n; j++) {
dtemp = A[k][j];
A[k][j] = A[pivot_row][j];
A[pivot_row][j] = dtemp;
}
int tmp = perm[k];
perm[k] = perm[pivot_row];
perm[pivot_row] = tmp;
}
if (diag == myid)
{
/* Compute L column */
dtemp = 1.0 / A[k][k];
for (i = k + 1; i < n; i++)
{
A[i][k] = A[i][k] * dtemp;
buf[i] = A[i][k];
}
/* Send L column to other processes */
for (j = diag + 1; j < numprocs; j++)
{
MPI_Send(&buf[k + 1], n - k - 1, MPI_DOUBLE, j, 0, MPI_COMM_WORLD);
}
j_start = k + 1;
}
else if (diag < myid)
{
MPI_Recv(&buf[k + 1], n - k - 1, MPI_DOUBLE, diag, 0, MPI_COMM_WORLD, &status);
}
else
{
continue;
}
for (i = k + 1; i < n; i++)
{
dtemp = buf[i];
for (j = j_start; j < j_end; j++)
{
A[i][j] = A[i][j] - A[k][j] * dtemp;
}
}
}
/* --------------------------------------- */
MPI_Barrier(MPI_COMM_WORLD);
int kk;
/* Forward substitution ------------------ */
for (k = 0; k < n; k++)
c[k] = 0.0;
j_start = myid * ib;
j_end = (myid + 1) * ib;
for (k = 0; k < n; k += ib)
{
if (k >= j_start)
{
int diag = k / ib;
if (myid != 0)
MPI_Recv(&c[k], ib, MPI_DOUBLE, myid - 1, k, MPI_COMM_WORLD, &status);
if (myid == diag)
{
for (kk = 0; kk < ib; kk++)
{
c[k + kk] = b[perm[k + kk]] + c[k + kk];
for (j = j_start; j < j_start + kk; j++)
c[k + kk] -= A[k + kk][j] * c[j];
}
}
else
{
for (kk = 0; kk < ib; kk++)
for (j = j_start; j < j_end; j++)
c[k + kk] -= A[k + kk][j] * c[j];
if (myid != numprocs - 1)
MPI_Send(&c[k], ib, MPI_DOUBLE, myid + 1, k, MPI_COMM_WORLD);
}
}
}
/* --------------------------------------- */
MPI_Barrier(MPI_COMM_WORLD);
/* Backward substitution ------------------ */
for (k = 0; k < n; k++)
x[k] = 0.0;
j_start = myid * ib;
j_end = (myid + 1) * ib;
for (k = n - 1; k >= 0; k -= ib)
{
if (k < j_end)
{
int diag = k / ib;
if (myid != numprocs - 1)
MPI_Recv(&x[k - ib + 1], ib, MPI_DOUBLE, myid + 1, k, MPI_COMM_WORLD, &status);
if (myid == diag)
{
for (kk = 0; kk < ib; kk++)
{
x[k - kk] = c[k - kk] + x[k - kk];
for (j = k - kk + 1; j < j_end; j++)
x[k - kk] -= A[k - kk][j] * x[j];
x[k - kk] = x[k - kk] / A[k - kk][k - kk];
}
}
else
{
for (kk = 0; kk < ib; kk++)
for (j = j_start; j < j_end; j++)
x[k - kk] -= A[k - kk][j] * x[j];
if (myid != 0)
MPI_Send(&x[k - ib + 1], ib, MPI_DOUBLE, myid - 1, k, MPI_COMM_WORLD);
}
}
}
/* Debug: print x values */
MPI_Barrier(MPI_COMM_WORLD);
}