-
Notifications
You must be signed in to change notification settings - Fork 1
/
demo_lc.cpp
290 lines (265 loc) · 7.85 KB
/
demo_lc.cpp
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "cktso.h"
#include "cktso-gpu.h"
bool ReadMtxFile(const char file[], long long &n, long long *&ap, long long *&ai, double *&ax)
{
FILE *fp = fopen(file, "r");
if (NULL == fp)
{
printf("Cannot open file \"%s\".\n", file);
return false;
}
char buf[256] = "\0";
bool first = true;
long long pc = 0;
long long ptr = 0;
while (fgets(buf, 256, fp) != NULL)
{
const char *p = buf;
while (*p != '\0')
{
if (' ' == *p || '\t' == *p || '\r' == *p || '\n' == *p) ++p;
else break;
}
if (*p == '\0') continue;
else if (*p == '%') continue;
else
{
if (first)
{
first = false;
long long r, c, nz;
sscanf(p, "%lld %lld %lld", &r, &c, &nz);
if (r != c)
{
printf("Matrix is not square because row = %lld and column = %lld.\n", r, c);
fclose(fp);
return false;
}
n = r;
ap = new long long [n + 1];
ai = new long long [nz];
ax = new double [nz];
if (NULL == ap || NULL == ai || NULL == ax)
{
printf("Malloc for matrix failed.\n");
fclose(fp);
return false;
}
ap[0] = 0;
}
else
{
long long r, c;
double v;
sscanf(p, "%lld %lld %lf", &r, &c, &v);
--r;
--c;
ai[ptr] = r;
ax[ptr] = v;
if (c != pc)
{
ap[c] = ptr;
pc = c;
}
++ptr;
}
}
}
ap[n] = ptr;
fclose(fp);
return true;
}
typedef double complex[2];
#define cmul(z, a, b) \
{ \
const double a0 = (a)[0]; \
const double a1 = (a)[1]; \
const double b0 = (b)[0]; \
const double b1 = (b)[1]; \
(z)[0] = a0 * b0 - a1 * b1; \
(z)[1] = a0 * b1 + a1 * b0; \
}
double L2NormOfResidual(const long long n, const long long ap[], const long long ai[], const complex ax[], const complex x[], const complex b[], bool row0_col1)
{
if (row0_col1)
{
complex *bb = new complex[n];
memcpy(bb, b, sizeof(complex) * n);
for (long long i = 0; i < n; ++i)
{
complex xx;
xx[0] = x[i][0];
xx[1] = x[i][1];
const long long start = ap[i];
const long long end = ap[i + 1];
for (long long p = start; p < end; ++p)
{
complex t;
cmul(t, xx, ax[p]);
bb[ai[p]][0] -= t[0];
bb[ai[p]][1] -= t[1];
}
}
double s = 0.;
for (long long i = 0; i < n; ++i)
{
s += bb[i][0] * bb[i][0] + bb[i][1] * bb[i][1];
}
delete []bb;
return sqrt(s);
}
else
{
double s = 0.;
for (long long i = 0; i < n; ++i)
{
complex r = { 0., 0. };
const long long start = ap[i];
const long long end = ap[i + 1];
for (long long p = start; p < end; ++p)
{
const long long j = ai[p];
complex t;
cmul(t, ax[p], x[j]);
r[0] += t[0];
r[1] += t[1];
}
r[0] -= b[i][0];
r[1] -= b[i][1];
s += r[0] * r[0] + r[1] * r[1];
}
return sqrt(s);
}
}
int main(int argc, char *argv[])
{
if (argc < 2)
{
printf("Usage: demo_lc <mtx file>\n");
printf("Example: demo_lc add20.mtx\n");
return -1;
}
int ret;
long long n, nnz;
long long *ap = NULL;
long long *ai = NULL;
double *ax = NULL;
double *cx = NULL;
ICktSo_L inst_cpu = NULL;
ICktSoGpu_L inst_gpu = NULL;
int *iparm_cpu, *iparm_gpu;
const long long *oparm_cpu, *oparm_gpu;
double *b = NULL;
double *x = NULL;
if (!ReadMtxFile(argv[1], n, ap, ai, ax)) goto EXIT;
nnz = ap[n];
cx = new double [nnz * 2];
if (NULL == cx)
{
printf("Malloc for cx failed.\n");
goto EXIT;
}
for (long long i = 0; i < nnz; ++i)
{
cx[i + i] = ax[i];
cx[i + i + 1] = ax[i] * ((double)rand() / RAND_MAX - .5) * 2.;//randomly generate imaginary parts
}
delete[]ax;
ax = NULL;
b = new double [n * 4];
x = b + n * 2;
if (NULL == b)
{
printf("Malloc for b and x failed.\n");
goto EXIT;
}
for (long long i = 0; i < n; ++i)
{
b[i + i] = (double)rand() / RAND_MAX * 100.;
b[i + i + 1] = (double)rand() / RAND_MAX * 100.;
x[i + i] = 0.;
x[i + i + 1] = 0.;
}
////////////////////////////////////////////////////////////////////
//create cpu solver instance
ret = CKTSO_L_CreateSolver(&inst_cpu, &iparm_cpu, &oparm_cpu);
if (ret < 0)
{
printf("Failed to create solver instance, return code = %d.\n", ret);
goto EXIT;
}
iparm_cpu[0] = 1;//enable timer
//cpu symbolic analysis
inst_cpu->Analyze(true, n, ap, ai, cx, 0);
printf("Analysis time = %g s.\n", oparm_cpu[0] * 1e-6);
//cpu factorization
inst_cpu->Factorize(cx, true);
printf("CPU factorization time = %g s.\n", oparm_cpu[1] * 1e-6);
//sort factors by cpu solver instance to reduce gpu accelerator initialization time
inst_cpu->SortFactors(true);
printf("CPU sort time = %g s.\n", oparm_cpu[3] * 1e-6);
////////////////////////////////////////////////////////////////////
//create gpu accelerator instance
ret = CKTSO_L_CreateGpuAccelerator(&inst_gpu, &iparm_gpu, &oparm_gpu, 0);
if (ret != 0)
{
printf("Failed to create gpu accelerator instance, return code = %d.\n", ret);
goto EXIT;
}
iparm_gpu[0] = 1;//enable timer
//initialize gpu accelerator data
ret = inst_gpu->InitializeGpuAccelerator(inst_cpu);
if (ret != 0)
{
printf("Failed to initialize gpu accelerator, return code = %d.\n", ret);
goto EXIT;
}
printf("GPU accelerator initialization time = %g s.\n", oparm_gpu[0] * 1e-6);
printf("GPU memory usage = %g GB.\n", (double)oparm_gpu[4] / 1024. / 1024. / 1024.);
//change cx values
for (long long i = 0; i < nnz; ++i)
{
cx[i + i] *= (double)rand() / RAND_MAX * 2.;
cx[i + i + 1] *= (double)rand() / RAND_MAX * 2.;
}
//refactorize matrix on gpu
ret = inst_gpu->GpuRefactorize(cx);
if (ret != 0)
{
printf("Failed to refactorize matrix on gpu, return code = %d.\n", ret);
goto EXIT;
}
printf("GPU refactorization time = %g s.\n", oparm_gpu[1] * 1e-6);
//solve on gpu
ret = inst_gpu->GpuSolve(b, x, false);
if (ret != 0)
{
printf("Failed to solve on gpu, return code = %d.\n", ret);
goto EXIT;
}
printf("GPU solving time = %g s.\n", oparm_gpu[2] * 1e-6);
//calculate error of solution
printf("Residual = %g.\n", L2NormOfResidual(n, ap, ai, (complex *)cx, (complex *)x, (complex *)b, false));
ret = inst_gpu->GpuSolve(b, x, true);
if (ret != 0)
{
printf("Failed to solve on gpu, return code = %d.\n", ret);
goto EXIT;
}
printf("GPU transposed solving time = %g s.\n", oparm_gpu[2] * 1e-6);
//calculate error of solution
printf("Residual = %g.\n", L2NormOfResidual(n, ap, ai, (complex *)cx, (complex *)x, (complex *)b, true));
EXIT:
delete []ap;
delete []ai;
delete []ax;
delete []cx;
delete []b;
inst_cpu->DestroySolver();
inst_gpu->DestroyGpuAccelerator();
return 0;
}