-
Notifications
You must be signed in to change notification settings - Fork 456
Expand file tree
/
Copy pathcusolver_csrqr_example2.cu
More file actions
249 lines (211 loc) · 10.1 KB
/
cusolver_csrqr_example2.cu
File metadata and controls
249 lines (211 loc) · 10.1 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
/*
* SPDX-FileCopyrightText: Copyright (c) 2020 NVIDIA CORPORATION & AFFILIATES. All rights reserved.
* SPDX-License-Identifier: Apache-2.0
*
* 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 <cstdio>
#include <cstdlib>
#include <vector>
#include <cuda_runtime.h>
#include <cusolverSp.h>
#include <cusparse.h>
#include "cusolver_utils.h"
int main(int argc, char *argv[]) {
cusolverSpHandle_t cusolverH = NULL;
csrqrInfo_t info = NULL;
cusparseMatDescr_t descrA = NULL;
cudaStream_t stream = NULL;
// GPU does batch QR
// d_A is CSR format, d_csrValA is of size nnzA*batchSize
// d_x is a matrix of size batchSize * m
// d_b is a matrix of size batchSize * m
int *d_csrRowPtrA = nullptr;
int *d_csrColIndA = nullptr;
double *d_csrValA = nullptr;
double *d_b = nullptr; // batchSize * m
double *d_x = nullptr; // batchSize * m
size_t size_qr = 0;
size_t size_internal = 0;
void *buffer_qr = nullptr; // working space for numerical factorization
/*
* | 1 |
* A = | 2 |
* | 3 |
* | 0.1 0.1 0.1 4 |
* CSR of A is based-1
*
* b = [1 1 1 1]
*/
const int m = 4;
const int nnzA = 7;
const std::vector<int> csrRowPtrA = {1, 2, 3, 4, 8};
const std::vector<int> csrColIndA = {1, 2, 3, 1, 2, 3, 4};
const std::vector<double> csrValA = {1.0, 2.0, 3.0, 0.1, 0.1, 0.1, 4.0};
const std::vector<double> b = {1.0, 1.0, 1.0, 1.0};
const int batchSize = 17;
std::vector<double> csrValABatch(nnzA * batchSize);
std::vector<double> bBatch(m * batchSize);
std::vector<double> xBatch(m * batchSize);
// step 1: prepare Aj and bj on host
// Aj is a small perturbation of A
// bj is a small perturbation of b
// csrValABatch = [A0, A1, A2, ...]
// bBatch = [b0, b1, b2, ...]
for (int colidx = 0; colidx < nnzA; colidx++) {
double Areg = csrValA[colidx];
for (int batchId = 0; batchId < batchSize; batchId++) {
double eps = (static_cast<double>((std::rand() % 100) + 1)) * 1.e-4;
csrValABatch[batchId * nnzA + colidx] = Areg + eps;
}
}
for (int j = 0; j < m; j++) {
double breg = b[j];
for (int batchId = 0; batchId < batchSize; batchId++) {
double eps = (static_cast<double>((std::rand() % 100) + 1)) * 1.e-4;
bBatch[batchId * m + j] = breg + eps;
}
}
// step 2: create cusolver handle, qr info and matrix descriptor
CUSOLVER_CHECK(cusolverSpCreate(&cusolverH));
CUDA_CHECK(cudaStreamCreateWithFlags(&stream, cudaStreamNonBlocking));
CUSOLVER_CHECK(cusolverSpSetStream(cusolverH, stream));
CUSPARSE_CHECK(cusparseCreateMatDescr(&descrA));
CUSPARSE_CHECK(cusparseSetMatType(descrA, CUSPARSE_MATRIX_TYPE_GENERAL));
CUSPARSE_CHECK(cusparseSetMatIndexBase(descrA, CUSPARSE_INDEX_BASE_ONE)); // base-1
CUSOLVER_CHECK(cusolverSpCreateCsrqrInfo(&info));
// step 3: copy Aj and bj to device
CUDA_CHECK(
cudaMalloc(reinterpret_cast<void **>(&d_csrValA), sizeof(double) * csrValABatch.size()));
CUDA_CHECK(
cudaMalloc(reinterpret_cast<void **>(&d_csrColIndA), sizeof(int) * csrColIndA.size()));
CUDA_CHECK(
cudaMalloc(reinterpret_cast<void **>(&d_csrRowPtrA), sizeof(int) * csrRowPtrA.size()));
CUDA_CHECK(cudaMalloc(reinterpret_cast<void **>(&d_b), sizeof(double) * bBatch.size()));
CUDA_CHECK(cudaMalloc(reinterpret_cast<void **>(&d_x), sizeof(double) * xBatch.size()));
CUDA_CHECK(cudaMemcpyAsync(d_csrColIndA, csrColIndA.data(), sizeof(int) * csrColIndA.size(),
cudaMemcpyHostToDevice, stream));
CUDA_CHECK(cudaMemcpyAsync(d_csrRowPtrA, csrRowPtrA.data(), sizeof(int) * csrRowPtrA.size(),
cudaMemcpyHostToDevice, stream));
// step 4: symbolic analysis
CUSOLVER_CHECK(cusolverSpXcsrqrAnalysisBatched(cusolverH, m, m, nnzA, descrA, d_csrRowPtrA,
d_csrColIndA, info));
CUDA_CHECK(cudaStreamSynchronize(stream));
// step 5: find "proper" batchSize
// get available device memory
size_t free_mem = 0;
size_t total_mem = 0;
CUDA_CHECK(cudaMemGetInfo(&free_mem, &total_mem));
int batchSizeMax = 2;
while (batchSizeMax < batchSize) {
std::printf("batchSizeMax = %d\n", batchSizeMax);
CUSOLVER_CHECK(cusolverSpDcsrqrBufferInfoBatched(cusolverH, m, m, nnzA,
// d_csrValA is don't care
descrA, d_csrValA, d_csrRowPtrA,
d_csrColIndA,
batchSizeMax, // WARNING: use batchSizeMax
info, &size_internal, &size_qr));
CUDA_CHECK(cudaStreamSynchronize(stream));
if ((size_internal + size_qr) > free_mem) {
// current batchSizeMax exceeds hardware limit, so cut it by half.
batchSizeMax /= 2;
break;
}
batchSizeMax *= 2; // double batchSizMax and try it again.
}
// correct batchSizeMax such that it is not greater than batchSize.
batchSizeMax = std::min(batchSizeMax, batchSize);
std::printf("batchSizeMax = %d\n", batchSizeMax);
// Assume device memory is not big enough, and batchSizeMax = 2
batchSizeMax = 2;
// step 6: prepare working space
// [necessary]
// Need to call cusolverDcsrqrBufferInfoBatched again with batchSizeMax
// to fix batchSize used in numerical factorization.
CUSOLVER_CHECK(cusolverSpDcsrqrBufferInfoBatched(cusolverH, m, m, nnzA,
// d_csrValA is don't care
descrA, d_csrValA, d_csrRowPtrA, d_csrColIndA,
batchSizeMax, // WARNING: use batchSizeMax
info, &size_internal, &size_qr));
CUDA_CHECK(cudaStreamSynchronize(stream));
std::printf("numerical factorization needs internal data %lld bytes\n",
static_cast<long long>(size_internal));
std::printf("numerical factorization needs working space %lld bytes\n",
static_cast<long long>(size_qr));
CUDA_CHECK(cudaMalloc(reinterpret_cast<void **>(&buffer_qr), size_qr));
// step 7: solve Aj*xj = bj
for (int idx = 0; idx < batchSize; idx += batchSizeMax) {
// current batchSize 'cur_batchSize' is the batchSize used in numerical
// factorization
const int cur_batchSize = std::min(batchSizeMax, batchSize - idx);
std::printf("current batchSize = %d\n", cur_batchSize);
// copy part of Aj and bj to device
CUDA_CHECK(cudaMemcpyAsync(d_csrValA, csrValABatch.data() + idx * nnzA,
sizeof(double) * nnzA * cur_batchSize, cudaMemcpyHostToDevice,
stream));
CUDA_CHECK(cudaMemcpyAsync(d_b, bBatch.data() + idx * m, sizeof(double) * m * cur_batchSize,
cudaMemcpyHostToDevice, stream));
// solve part of Aj*xj = bj
CUSOLVER_CHECK(cusolverSpDcsrqrsvBatched(cusolverH, m, m, nnzA, descrA, d_csrValA,
d_csrRowPtrA, d_csrColIndA, d_b, d_x,
cur_batchSize, // WARNING: use current batchSize
info, buffer_qr));
// copy part of xj back to host
CUDA_CHECK(cudaMemcpyAsync(xBatch.data() + idx * m, d_x, sizeof(double) * m * cur_batchSize,
cudaMemcpyDeviceToHost, stream));
}
CUDA_CHECK(cudaStreamSynchronize(stream));
// step 8: check residual
// xBatch = [x0, x1, x2, ...]
const int baseA = (CUSPARSE_INDEX_BASE_ONE == cusparseGetMatIndexBase(descrA)) ? 1 : 0;
for (int batchId = 0; batchId < batchSize; batchId++) {
// measure |bj - Aj*xj|
double *csrValAj = csrValABatch.data() + batchId * nnzA;
double *xj = xBatch.data() + batchId * m;
double *bj = bBatch.data() + batchId * m;
// sup| bj - Aj*xj|
double sup_res = 0;
for (int row = 0; row < m; row++) {
const int start = csrRowPtrA[row] - baseA;
const int end = csrRowPtrA[row + 1] - baseA;
double Ax = 0.0; // Aj(row,:)*xj
for (int colidx = start; colidx < end; colidx++) {
const int col = csrColIndA[colidx] - baseA;
const double Areg = csrValAj[colidx];
const double xreg = xj[col];
Ax = Ax + Areg * xreg;
}
double r = bj[row] - Ax;
sup_res = (sup_res > fabs(r)) ? sup_res : fabs(r);
}
std::printf("batchId %d: sup|bj - Aj*xj| = %E \n", batchId, sup_res);
}
for (int batchId = 0; batchId < batchSize; batchId++) {
double *xj = xBatch.data() + batchId * m;
for (int row = 0; row < m; row++) {
std::printf("x%d[%d] = %E\n", batchId, row, xj[row]);
}
std::printf("\n");
}
/* free resources */
CUDA_CHECK(cudaFree(d_csrRowPtrA));
CUDA_CHECK(cudaFree(d_csrColIndA));
CUDA_CHECK(cudaFree(d_csrValA));
CUDA_CHECK(cudaFree(d_b));
CUDA_CHECK(cudaFree(d_x));
CUDA_CHECK(cudaFree(buffer_qr));
CUSOLVER_CHECK(cusolverSpDestroy(cusolverH));
CUDA_CHECK(cudaStreamDestroy(stream));
CUDA_CHECK(cudaDeviceReset());
return EXIT_SUCCESS;
}