mirror of
https://github.com/NVIDIA/cuda-samples.git
synced 2026-10-25 22:28:17 +08:00
Apply consistent code formatting across the repo. Add clang-format and pre-commit hooks.
This commit is contained in:
@@ -29,6 +29,7 @@
|
||||
#include <cuda_runtime.h>
|
||||
#include <helper_cuda.h>
|
||||
#include <vector>
|
||||
|
||||
#include "jacobi.h"
|
||||
|
||||
namespace cg = cooperative_groups;
|
||||
@@ -39,355 +40,356 @@ namespace cg = cooperative_groups;
|
||||
|
||||
#if !defined(__CUDA_ARCH__) || __CUDA_ARCH__ >= 600
|
||||
#else
|
||||
__device__ double atomicAdd(double *address, double val) {
|
||||
unsigned long long int *address_as_ull = (unsigned long long int *)address;
|
||||
unsigned long long int old = *address_as_ull, assumed;
|
||||
__device__ double atomicAdd(double *address, double val)
|
||||
{
|
||||
unsigned long long int *address_as_ull = (unsigned long long int *)address;
|
||||
unsigned long long int old = *address_as_ull, assumed;
|
||||
|
||||
do {
|
||||
assumed = old;
|
||||
old = atomicCAS(address_as_ull, assumed,
|
||||
__double_as_longlong(val + __longlong_as_double(assumed)));
|
||||
do {
|
||||
assumed = old;
|
||||
old = atomicCAS(address_as_ull, assumed, __double_as_longlong(val + __longlong_as_double(assumed)));
|
||||
|
||||
// Note: uses integer comparison to avoid hang in case of NaN (since NaN !=
|
||||
// NaN)
|
||||
} while (assumed != old);
|
||||
// Note: uses integer comparison to avoid hang in case of NaN (since NaN !=
|
||||
// NaN)
|
||||
} while (assumed != old);
|
||||
|
||||
return __longlong_as_double(old);
|
||||
return __longlong_as_double(old);
|
||||
}
|
||||
#endif
|
||||
|
||||
static __global__ void JacobiMethod(const float *A, const double *b,
|
||||
const float conv_threshold, double *x,
|
||||
double *x_new, double *sum) {
|
||||
// Handle to thread block group
|
||||
cg::thread_block cta = cg::this_thread_block();
|
||||
__shared__ double x_shared[N_ROWS]; // N_ROWS == n
|
||||
__shared__ double b_shared[ROWS_PER_CTA + 1];
|
||||
static __global__ void
|
||||
JacobiMethod(const float *A, const double *b, const float conv_threshold, double *x, double *x_new, double *sum)
|
||||
{
|
||||
// Handle to thread block group
|
||||
cg::thread_block cta = cg::this_thread_block();
|
||||
__shared__ double x_shared[N_ROWS]; // N_ROWS == n
|
||||
__shared__ double b_shared[ROWS_PER_CTA + 1];
|
||||
|
||||
for (int i = threadIdx.x; i < N_ROWS; i += blockDim.x) {
|
||||
x_shared[i] = x[i];
|
||||
}
|
||||
|
||||
if (threadIdx.x < ROWS_PER_CTA) {
|
||||
int k = threadIdx.x;
|
||||
for (int i = k + (blockIdx.x * ROWS_PER_CTA);
|
||||
(k < ROWS_PER_CTA) && (i < N_ROWS);
|
||||
k += ROWS_PER_CTA, i += ROWS_PER_CTA) {
|
||||
b_shared[i % (ROWS_PER_CTA + 1)] = b[i];
|
||||
}
|
||||
}
|
||||
|
||||
cg::sync(cta);
|
||||
|
||||
cg::thread_block_tile<32> tile32 = cg::tiled_partition<32>(cta);
|
||||
|
||||
for (int k = 0, i = blockIdx.x * ROWS_PER_CTA;
|
||||
(k < ROWS_PER_CTA) && (i < N_ROWS); k++, i++) {
|
||||
double rowThreadSum = 0.0;
|
||||
for (int j = threadIdx.x; j < N_ROWS; j += blockDim.x) {
|
||||
rowThreadSum += (A[i * N_ROWS + j] * x_shared[j]);
|
||||
for (int i = threadIdx.x; i < N_ROWS; i += blockDim.x) {
|
||||
x_shared[i] = x[i];
|
||||
}
|
||||
|
||||
for (int offset = tile32.size() / 2; offset > 0; offset /= 2) {
|
||||
rowThreadSum += tile32.shfl_down(rowThreadSum, offset);
|
||||
if (threadIdx.x < ROWS_PER_CTA) {
|
||||
int k = threadIdx.x;
|
||||
for (int i = k + (blockIdx.x * ROWS_PER_CTA); (k < ROWS_PER_CTA) && (i < N_ROWS);
|
||||
k += ROWS_PER_CTA, i += ROWS_PER_CTA) {
|
||||
b_shared[i % (ROWS_PER_CTA + 1)] = b[i];
|
||||
}
|
||||
}
|
||||
|
||||
if (tile32.thread_rank() == 0) {
|
||||
atomicAdd(&b_shared[i % (ROWS_PER_CTA + 1)], -rowThreadSum);
|
||||
}
|
||||
}
|
||||
cg::sync(cta);
|
||||
|
||||
cg::sync(cta);
|
||||
cg::thread_block_tile<32> tile32 = cg::tiled_partition<32>(cta);
|
||||
|
||||
if (threadIdx.x < ROWS_PER_CTA) {
|
||||
cg::thread_block_tile<ROWS_PER_CTA> tile8 =
|
||||
cg::tiled_partition<ROWS_PER_CTA>(cta);
|
||||
double temp_sum = 0.0;
|
||||
for (int k = 0, i = blockIdx.x * ROWS_PER_CTA; (k < ROWS_PER_CTA) && (i < N_ROWS); k++, i++) {
|
||||
double rowThreadSum = 0.0;
|
||||
for (int j = threadIdx.x; j < N_ROWS; j += blockDim.x) {
|
||||
rowThreadSum += (A[i * N_ROWS + j] * x_shared[j]);
|
||||
}
|
||||
|
||||
int k = threadIdx.x;
|
||||
for (int offset = tile32.size() / 2; offset > 0; offset /= 2) {
|
||||
rowThreadSum += tile32.shfl_down(rowThreadSum, offset);
|
||||
}
|
||||
|
||||
for (int i = k + (blockIdx.x * ROWS_PER_CTA);
|
||||
(k < ROWS_PER_CTA) && (i < N_ROWS);
|
||||
k += ROWS_PER_CTA, i += ROWS_PER_CTA) {
|
||||
double dx = b_shared[i % (ROWS_PER_CTA + 1)];
|
||||
dx /= A[i * N_ROWS + i];
|
||||
|
||||
x_new[i] = (x_shared[i] + dx);
|
||||
temp_sum += fabs(dx);
|
||||
if (tile32.thread_rank() == 0) {
|
||||
atomicAdd(&b_shared[i % (ROWS_PER_CTA + 1)], -rowThreadSum);
|
||||
}
|
||||
}
|
||||
|
||||
for (int offset = tile8.size() / 2; offset > 0; offset /= 2) {
|
||||
temp_sum += tile8.shfl_down(temp_sum, offset);
|
||||
}
|
||||
cg::sync(cta);
|
||||
|
||||
if (tile8.thread_rank() == 0) {
|
||||
atomicAdd(sum, temp_sum);
|
||||
if (threadIdx.x < ROWS_PER_CTA) {
|
||||
cg::thread_block_tile<ROWS_PER_CTA> tile8 = cg::tiled_partition<ROWS_PER_CTA>(cta);
|
||||
double temp_sum = 0.0;
|
||||
|
||||
int k = threadIdx.x;
|
||||
|
||||
for (int i = k + (blockIdx.x * ROWS_PER_CTA); (k < ROWS_PER_CTA) && (i < N_ROWS);
|
||||
k += ROWS_PER_CTA, i += ROWS_PER_CTA) {
|
||||
double dx = b_shared[i % (ROWS_PER_CTA + 1)];
|
||||
dx /= A[i * N_ROWS + i];
|
||||
|
||||
x_new[i] = (x_shared[i] + dx);
|
||||
temp_sum += fabs(dx);
|
||||
}
|
||||
|
||||
for (int offset = tile8.size() / 2; offset > 0; offset /= 2) {
|
||||
temp_sum += tile8.shfl_down(temp_sum, offset);
|
||||
}
|
||||
|
||||
if (tile8.thread_rank() == 0) {
|
||||
atomicAdd(sum, temp_sum);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Thread block size for finalError kernel should be multiple of 32
|
||||
static __global__ void finalError(double *x, double *g_sum) {
|
||||
// Handle to thread block group
|
||||
cg::thread_block cta = cg::this_thread_block();
|
||||
extern __shared__ double warpSum[];
|
||||
double sum = 0.0;
|
||||
static __global__ void finalError(double *x, double *g_sum)
|
||||
{
|
||||
// Handle to thread block group
|
||||
cg::thread_block cta = cg::this_thread_block();
|
||||
extern __shared__ double warpSum[];
|
||||
double sum = 0.0;
|
||||
|
||||
int globalThreadId = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
int globalThreadId = blockIdx.x * blockDim.x + threadIdx.x;
|
||||
|
||||
for (int i = globalThreadId; i < N_ROWS; i += blockDim.x * gridDim.x) {
|
||||
double d = x[i] - 1.0;
|
||||
sum += fabs(d);
|
||||
}
|
||||
for (int i = globalThreadId; i < N_ROWS; i += blockDim.x * gridDim.x) {
|
||||
double d = x[i] - 1.0;
|
||||
sum += fabs(d);
|
||||
}
|
||||
|
||||
cg::thread_block_tile<32> tile32 = cg::tiled_partition<32>(cta);
|
||||
cg::thread_block_tile<32> tile32 = cg::tiled_partition<32>(cta);
|
||||
|
||||
for (int offset = tile32.size() / 2; offset > 0; offset /= 2) {
|
||||
sum += tile32.shfl_down(sum, offset);
|
||||
}
|
||||
|
||||
if (tile32.thread_rank() == 0) {
|
||||
warpSum[threadIdx.x / warpSize] = sum;
|
||||
}
|
||||
|
||||
cg::sync(cta);
|
||||
|
||||
double blockSum = 0.0;
|
||||
if (threadIdx.x < (blockDim.x / warpSize)) {
|
||||
blockSum = warpSum[threadIdx.x];
|
||||
}
|
||||
|
||||
if (threadIdx.x < 32) {
|
||||
for (int offset = tile32.size() / 2; offset > 0; offset /= 2) {
|
||||
blockSum += tile32.shfl_down(blockSum, offset);
|
||||
sum += tile32.shfl_down(sum, offset);
|
||||
}
|
||||
|
||||
if (tile32.thread_rank() == 0) {
|
||||
atomicAdd(g_sum, blockSum);
|
||||
warpSum[threadIdx.x / warpSize] = sum;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
double JacobiMethodGpuCudaGraphExecKernelSetParams(
|
||||
const float *A, const double *b, const float conv_threshold,
|
||||
const int max_iter, double *x, double *x_new, cudaStream_t stream) {
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
cudaGraph_t graph;
|
||||
cudaGraphExec_t graphExec = NULL;
|
||||
cg::sync(cta);
|
||||
|
||||
double sum = 0.0;
|
||||
double *d_sum = NULL;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
|
||||
std::vector<cudaGraphNode_t> nodeDependencies;
|
||||
cudaGraphNode_t memcpyNode, jacobiKernelNode, memsetNode;
|
||||
cudaMemcpy3DParms memcpyParams = {0};
|
||||
cudaMemsetParams memsetParams = {0};
|
||||
|
||||
memsetParams.dst = (void *)d_sum;
|
||||
memsetParams.value = 0;
|
||||
memsetParams.pitch = 0;
|
||||
// elementSize can be max 4 bytes, so we take sizeof(float) and width=2
|
||||
memsetParams.elementSize = sizeof(float);
|
||||
memsetParams.width = 2;
|
||||
memsetParams.height = 1;
|
||||
|
||||
checkCudaErrors(cudaGraphCreate(&graph, 0));
|
||||
checkCudaErrors(
|
||||
cudaGraphAddMemsetNode(&memsetNode, graph, NULL, 0, &memsetParams));
|
||||
nodeDependencies.push_back(memsetNode);
|
||||
|
||||
cudaKernelNodeParams NodeParams0, NodeParams1;
|
||||
NodeParams0.func = (void *)JacobiMethod;
|
||||
NodeParams0.gridDim = nblocks;
|
||||
NodeParams0.blockDim = nthreads;
|
||||
NodeParams0.sharedMemBytes = 0;
|
||||
void *kernelArgs0[6] = {(void *)&A, (void *)&b, (void *)&conv_threshold,
|
||||
(void *)&x, (void *)&x_new, (void *)&d_sum};
|
||||
NodeParams0.kernelParams = kernelArgs0;
|
||||
NodeParams0.extra = NULL;
|
||||
|
||||
checkCudaErrors(
|
||||
cudaGraphAddKernelNode(&jacobiKernelNode, graph, nodeDependencies.data(),
|
||||
nodeDependencies.size(), &NodeParams0));
|
||||
|
||||
nodeDependencies.clear();
|
||||
nodeDependencies.push_back(jacobiKernelNode);
|
||||
|
||||
memcpyParams.srcArray = NULL;
|
||||
memcpyParams.srcPos = make_cudaPos(0, 0, 0);
|
||||
memcpyParams.srcPtr = make_cudaPitchedPtr(d_sum, sizeof(double), 1, 1);
|
||||
memcpyParams.dstArray = NULL;
|
||||
memcpyParams.dstPos = make_cudaPos(0, 0, 0);
|
||||
memcpyParams.dstPtr = make_cudaPitchedPtr(&sum, sizeof(double), 1, 1);
|
||||
memcpyParams.extent = make_cudaExtent(sizeof(double), 1, 1);
|
||||
memcpyParams.kind = cudaMemcpyDeviceToHost;
|
||||
|
||||
checkCudaErrors(
|
||||
cudaGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(),
|
||||
nodeDependencies.size(), &memcpyParams));
|
||||
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
|
||||
NodeParams1.func = (void *)JacobiMethod;
|
||||
NodeParams1.gridDim = nblocks;
|
||||
NodeParams1.blockDim = nthreads;
|
||||
NodeParams1.sharedMemBytes = 0;
|
||||
void *kernelArgs1[6] = {(void *)&A, (void *)&b, (void *)&conv_threshold,
|
||||
(void *)&x_new, (void *)&x, (void *)&d_sum};
|
||||
NodeParams1.kernelParams = kernelArgs1;
|
||||
NodeParams1.extra = NULL;
|
||||
|
||||
int k = 0;
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(cudaGraphExecKernelNodeSetParams(
|
||||
graphExec, jacobiKernelNode,
|
||||
((k & 1) == 0) ? &NodeParams0 : &NodeParams1));
|
||||
checkCudaErrors(cudaGraphLaunch(graphExec, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
} else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double),
|
||||
cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
double blockSum = 0.0;
|
||||
if (threadIdx.x < (blockDim.x / warpSize)) {
|
||||
blockSum = warpSum[threadIdx.x];
|
||||
}
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
}
|
||||
|
||||
double JacobiMethodGpuCudaGraphExecUpdate(const float *A, const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter, double *x,
|
||||
double *x_new, cudaStream_t stream) {
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
cudaGraph_t graph;
|
||||
cudaGraphExec_t graphExec = NULL;
|
||||
|
||||
double sum = 0.0;
|
||||
double *d_sum;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
|
||||
int k = 0;
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(
|
||||
cudaStreamBeginCapture(stream, cudaStreamCaptureModeGlobal));
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
if ((k & 1) == 0) {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x,
|
||||
x_new, d_sum);
|
||||
} else {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold,
|
||||
x_new, x, d_sum);
|
||||
}
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double),
|
||||
cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamEndCapture(stream, &graph));
|
||||
|
||||
if (graphExec == NULL) {
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
} else {
|
||||
cudaGraphExecUpdateResult updateResult_out;
|
||||
checkCudaErrors(
|
||||
cudaGraphExecUpdate(graphExec, graph, NULL, &updateResult_out));
|
||||
if (updateResult_out != cudaGraphExecUpdateSuccess) {
|
||||
if (graphExec != NULL) {
|
||||
checkCudaErrors(cudaGraphExecDestroy(graphExec));
|
||||
if (threadIdx.x < 32) {
|
||||
for (int offset = tile32.size() / 2; offset > 0; offset /= 2) {
|
||||
blockSum += tile32.shfl_down(blockSum, offset);
|
||||
}
|
||||
if (tile32.thread_rank() == 0) {
|
||||
atomicAdd(g_sum, blockSum);
|
||||
}
|
||||
printf("k = %d graph update failed with error - %d\n", k,
|
||||
updateResult_out);
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
}
|
||||
}
|
||||
checkCudaErrors(cudaGraphLaunch(graphExec, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
} else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double),
|
||||
cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
}
|
||||
|
||||
double JacobiMethodGpu(const float *A, const double *b,
|
||||
const float conv_threshold, const int max_iter,
|
||||
double *x, double *x_new, cudaStream_t stream) {
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
double JacobiMethodGpuCudaGraphExecKernelSetParams(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream)
|
||||
{
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
cudaGraph_t graph;
|
||||
cudaGraphExec_t graphExec = NULL;
|
||||
|
||||
double sum = 0.0;
|
||||
double *d_sum;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
int k = 0;
|
||||
double sum = 0.0;
|
||||
double *d_sum = NULL;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
if ((k & 1) == 0) {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x,
|
||||
x_new, d_sum);
|
||||
} else {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold,
|
||||
x_new, x, d_sum);
|
||||
std::vector<cudaGraphNode_t> nodeDependencies;
|
||||
cudaGraphNode_t memcpyNode, jacobiKernelNode, memsetNode;
|
||||
cudaMemcpy3DParms memcpyParams = {0};
|
||||
cudaMemsetParams memsetParams = {0};
|
||||
|
||||
memsetParams.dst = (void *)d_sum;
|
||||
memsetParams.value = 0;
|
||||
memsetParams.pitch = 0;
|
||||
// elementSize can be max 4 bytes, so we take sizeof(float) and width=2
|
||||
memsetParams.elementSize = sizeof(float);
|
||||
memsetParams.width = 2;
|
||||
memsetParams.height = 1;
|
||||
|
||||
checkCudaErrors(cudaGraphCreate(&graph, 0));
|
||||
checkCudaErrors(cudaGraphAddMemsetNode(&memsetNode, graph, NULL, 0, &memsetParams));
|
||||
nodeDependencies.push_back(memsetNode);
|
||||
|
||||
cudaKernelNodeParams NodeParams0, NodeParams1;
|
||||
NodeParams0.func = (void *)JacobiMethod;
|
||||
NodeParams0.gridDim = nblocks;
|
||||
NodeParams0.blockDim = nthreads;
|
||||
NodeParams0.sharedMemBytes = 0;
|
||||
void *kernelArgs0[6] = {
|
||||
(void *)&A, (void *)&b, (void *)&conv_threshold, (void *)&x, (void *)&x_new, (void *)&d_sum};
|
||||
NodeParams0.kernelParams = kernelArgs0;
|
||||
NodeParams0.extra = NULL;
|
||||
|
||||
checkCudaErrors(cudaGraphAddKernelNode(
|
||||
&jacobiKernelNode, graph, nodeDependencies.data(), nodeDependencies.size(), &NodeParams0));
|
||||
|
||||
nodeDependencies.clear();
|
||||
nodeDependencies.push_back(jacobiKernelNode);
|
||||
|
||||
memcpyParams.srcArray = NULL;
|
||||
memcpyParams.srcPos = make_cudaPos(0, 0, 0);
|
||||
memcpyParams.srcPtr = make_cudaPitchedPtr(d_sum, sizeof(double), 1, 1);
|
||||
memcpyParams.dstArray = NULL;
|
||||
memcpyParams.dstPos = make_cudaPos(0, 0, 0);
|
||||
memcpyParams.dstPtr = make_cudaPitchedPtr(&sum, sizeof(double), 1, 1);
|
||||
memcpyParams.extent = make_cudaExtent(sizeof(double), 1, 1);
|
||||
memcpyParams.kind = cudaMemcpyDeviceToHost;
|
||||
|
||||
checkCudaErrors(
|
||||
cudaGraphAddMemcpyNode(&memcpyNode, graph, nodeDependencies.data(), nodeDependencies.size(), &memcpyParams));
|
||||
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
|
||||
NodeParams1.func = (void *)JacobiMethod;
|
||||
NodeParams1.gridDim = nblocks;
|
||||
NodeParams1.blockDim = nthreads;
|
||||
NodeParams1.sharedMemBytes = 0;
|
||||
void *kernelArgs1[6] = {
|
||||
(void *)&A, (void *)&b, (void *)&conv_threshold, (void *)&x_new, (void *)&x, (void *)&d_sum};
|
||||
NodeParams1.kernelParams = kernelArgs1;
|
||||
NodeParams1.extra = NULL;
|
||||
|
||||
int k = 0;
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(cudaGraphExecKernelNodeSetParams(
|
||||
graphExec, jacobiKernelNode, ((k & 1) == 0) ? &NodeParams0 : &NodeParams1));
|
||||
checkCudaErrors(cudaGraphLaunch(graphExec, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
}
|
||||
else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double), cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
}
|
||||
}
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double),
|
||||
cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
} else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double),
|
||||
cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
}
|
||||
|
||||
double JacobiMethodGpuCudaGraphExecUpdate(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream)
|
||||
{
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
cudaGraph_t graph;
|
||||
cudaGraphExec_t graphExec = NULL;
|
||||
|
||||
double sum = 0.0;
|
||||
double *d_sum;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
|
||||
int k = 0;
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(cudaStreamBeginCapture(stream, cudaStreamCaptureModeGlobal));
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
if ((k & 1) == 0) {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x, x_new, d_sum);
|
||||
}
|
||||
else {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x_new, x, d_sum);
|
||||
}
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double), cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamEndCapture(stream, &graph));
|
||||
|
||||
if (graphExec == NULL) {
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
}
|
||||
else {
|
||||
cudaGraphExecUpdateResult updateResult_out;
|
||||
checkCudaErrors(cudaGraphExecUpdate(graphExec, graph, NULL, &updateResult_out));
|
||||
if (updateResult_out != cudaGraphExecUpdateSuccess) {
|
||||
if (graphExec != NULL) {
|
||||
checkCudaErrors(cudaGraphExecDestroy(graphExec));
|
||||
}
|
||||
printf("k = %d graph update failed with error - %d\n", k, updateResult_out);
|
||||
checkCudaErrors(cudaGraphInstantiate(&graphExec, graph, NULL, NULL, 0));
|
||||
}
|
||||
}
|
||||
checkCudaErrors(cudaGraphLaunch(graphExec, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
}
|
||||
else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double), cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
}
|
||||
|
||||
double JacobiMethodGpu(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream)
|
||||
{
|
||||
// CTA size
|
||||
dim3 nthreads(256, 1, 1);
|
||||
// grid size
|
||||
dim3 nblocks((N_ROWS / ROWS_PER_CTA) + 2, 1, 1);
|
||||
|
||||
double sum = 0.0;
|
||||
double *d_sum;
|
||||
checkCudaErrors(cudaMalloc(&d_sum, sizeof(double)));
|
||||
int k = 0;
|
||||
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
if ((k & 1) == 0) {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x, x_new, d_sum);
|
||||
}
|
||||
else {
|
||||
JacobiMethod<<<nblocks, nthreads, 0, stream>>>(A, b, conv_threshold, x_new, x, d_sum);
|
||||
}
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double), cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
|
||||
if (sum <= conv_threshold) {
|
||||
checkCudaErrors(cudaMemsetAsync(d_sum, 0, sizeof(double), stream));
|
||||
nblocks.x = (N_ROWS / nthreads.x) + 1;
|
||||
size_t sharedMemSize = ((nthreads.x / 32) + 1) * sizeof(double);
|
||||
if ((k & 1) == 0) {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x_new, d_sum);
|
||||
}
|
||||
else {
|
||||
finalError<<<nblocks, nthreads, sharedMemSize, stream>>>(x, d_sum);
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaMemcpyAsync(&sum, d_sum, sizeof(double), cudaMemcpyDeviceToHost, stream));
|
||||
checkCudaErrors(cudaStreamSynchronize(stream));
|
||||
printf("GPU iterations : %d\n", k + 1);
|
||||
printf("GPU error : %.3e\n", sum);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
checkCudaErrors(cudaFree(d_sum));
|
||||
return sum;
|
||||
}
|
||||
|
||||
@@ -30,4 +30,4 @@
|
||||
|
||||
#define N_ROWS 512
|
||||
|
||||
#endif
|
||||
#endif
|
||||
|
||||
@@ -43,24 +43,37 @@
|
||||
#include <math.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "jacobi.h"
|
||||
|
||||
// Run the Jacobi method for A*x = b on GPU with CUDA Graph -
|
||||
// cudaGraphExecKernelNodeSetParams().
|
||||
extern double JacobiMethodGpuCudaGraphExecKernelSetParams(
|
||||
const float *A, const double *b, const float conv_threshold,
|
||||
const int max_iter, double *x, double *x_new, cudaStream_t stream);
|
||||
extern double JacobiMethodGpuCudaGraphExecKernelSetParams(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream);
|
||||
|
||||
// Run the Jacobi method for A*x = b on GPU with Instantiated CUDA Graph Update
|
||||
// API - cudaGraphExecUpdate().
|
||||
extern double JacobiMethodGpuCudaGraphExecUpdate(
|
||||
const float *A, const double *b, const float conv_threshold,
|
||||
const int max_iter, double *x, double *x_new, cudaStream_t stream);
|
||||
extern double JacobiMethodGpuCudaGraphExecUpdate(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream);
|
||||
|
||||
// Run the Jacobi method for A*x = b on GPU without CUDA Graph.
|
||||
extern double JacobiMethodGpu(const float *A, const double *b,
|
||||
const float conv_threshold, const int max_iter,
|
||||
double *x, double *x_new, cudaStream_t stream);
|
||||
extern double JacobiMethodGpu(const float *A,
|
||||
const double *b,
|
||||
const float conv_threshold,
|
||||
const int max_iter,
|
||||
double *x,
|
||||
double *x_new,
|
||||
cudaStream_t stream);
|
||||
|
||||
// creates N_ROWS x N_ROWS matrix A with N_ROWS+1 on the diagonal and 1
|
||||
// elsewhere. The elements of the right hand side b all equal 2*n, hence the
|
||||
@@ -68,148 +81,146 @@ extern double JacobiMethodGpu(const float *A, const double *b,
|
||||
void createLinearSystem(float *A, double *b);
|
||||
|
||||
// Run the Jacobi method for A*x = b on CPU.
|
||||
void JacobiMethodCPU(float *A, double *b, float conv_threshold, int max_iter,
|
||||
int *numit, double *x);
|
||||
void JacobiMethodCPU(float *A, double *b, float conv_threshold, int max_iter, int *numit, double *x);
|
||||
|
||||
int main(int argc, char **argv) {
|
||||
if (checkCmdLineFlag(argc, (const char **)argv, "help")) {
|
||||
printf("Command line: jacobiCudaGraphs [-option]\n");
|
||||
printf("Valid options:\n");
|
||||
printf(
|
||||
"-gpumethod=<0,1 or 2> : 0 - [Default] "
|
||||
"JacobiMethodGpuCudaGraphExecKernelSetParams\n");
|
||||
printf(" : 1 - JacobiMethodGpuCudaGraphExecUpdate\n");
|
||||
printf(" : 2 - JacobiMethodGpu - Non CUDA Graph\n");
|
||||
printf("-device=device_num : cuda device id");
|
||||
printf("-help : Output a help message\n");
|
||||
exit(EXIT_SUCCESS);
|
||||
}
|
||||
|
||||
int gpumethod = 0;
|
||||
if (checkCmdLineFlag(argc, (const char **)argv, "gpumethod")) {
|
||||
gpumethod = getCmdLineArgumentInt(argc, (const char **)argv, "gpumethod");
|
||||
|
||||
if (gpumethod < 0 || gpumethod > 2) {
|
||||
printf("Error: gpumethod must be 0 or 1 or 2, gpumethod=%d is invalid\n",
|
||||
gpumethod);
|
||||
exit(EXIT_SUCCESS);
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
if (checkCmdLineFlag(argc, (const char **)argv, "help")) {
|
||||
printf("Command line: jacobiCudaGraphs [-option]\n");
|
||||
printf("Valid options:\n");
|
||||
printf("-gpumethod=<0,1 or 2> : 0 - [Default] "
|
||||
"JacobiMethodGpuCudaGraphExecKernelSetParams\n");
|
||||
printf(" : 1 - JacobiMethodGpuCudaGraphExecUpdate\n");
|
||||
printf(" : 2 - JacobiMethodGpu - Non CUDA Graph\n");
|
||||
printf("-device=device_num : cuda device id");
|
||||
printf("-help : Output a help message\n");
|
||||
exit(EXIT_SUCCESS);
|
||||
}
|
||||
}
|
||||
|
||||
int dev = findCudaDevice(argc, (const char **)argv);
|
||||
int gpumethod = 0;
|
||||
if (checkCmdLineFlag(argc, (const char **)argv, "gpumethod")) {
|
||||
gpumethod = getCmdLineArgumentInt(argc, (const char **)argv, "gpumethod");
|
||||
|
||||
double *b = NULL;
|
||||
float *A = NULL;
|
||||
checkCudaErrors(cudaMallocHost(&b, N_ROWS * sizeof(double)));
|
||||
memset(b, 0, N_ROWS * sizeof(double));
|
||||
checkCudaErrors(cudaMallocHost(&A, N_ROWS * N_ROWS * sizeof(float)));
|
||||
memset(A, 0, N_ROWS * N_ROWS * sizeof(float));
|
||||
if (gpumethod < 0 || gpumethod > 2) {
|
||||
printf("Error: gpumethod must be 0 or 1 or 2, gpumethod=%d is invalid\n", gpumethod);
|
||||
exit(EXIT_SUCCESS);
|
||||
}
|
||||
}
|
||||
|
||||
createLinearSystem(A, b);
|
||||
double *x = NULL;
|
||||
// start with array of all zeroes
|
||||
x = (double *)calloc(N_ROWS, sizeof(double));
|
||||
int dev = findCudaDevice(argc, (const char **)argv);
|
||||
|
||||
float conv_threshold = 1.0e-2;
|
||||
int max_iter = 4 * N_ROWS * N_ROWS;
|
||||
int cnt = 0;
|
||||
double *b = NULL;
|
||||
float *A = NULL;
|
||||
checkCudaErrors(cudaMallocHost(&b, N_ROWS * sizeof(double)));
|
||||
memset(b, 0, N_ROWS * sizeof(double));
|
||||
checkCudaErrors(cudaMallocHost(&A, N_ROWS * N_ROWS * sizeof(float)));
|
||||
memset(A, 0, N_ROWS * N_ROWS * sizeof(float));
|
||||
|
||||
// create timer
|
||||
StopWatchInterface *timerCPU = NULL, *timerGpu = NULL;
|
||||
sdkCreateTimer(&timerCPU);
|
||||
createLinearSystem(A, b);
|
||||
double *x = NULL;
|
||||
// start with array of all zeroes
|
||||
x = (double *)calloc(N_ROWS, sizeof(double));
|
||||
|
||||
sdkStartTimer(&timerCPU);
|
||||
JacobiMethodCPU(A, b, conv_threshold, max_iter, &cnt, x);
|
||||
float conv_threshold = 1.0e-2;
|
||||
int max_iter = 4 * N_ROWS * N_ROWS;
|
||||
int cnt = 0;
|
||||
|
||||
double sum = 0.0;
|
||||
// Compute error
|
||||
for (int i = 0; i < N_ROWS; i++) {
|
||||
double d = x[i] - 1.0;
|
||||
sum += fabs(d);
|
||||
}
|
||||
sdkStopTimer(&timerCPU);
|
||||
printf("CPU iterations : %d\n", cnt);
|
||||
printf("CPU error : %.3e\n", sum);
|
||||
printf("CPU Processing time: %f (ms)\n", sdkGetTimerValue(&timerCPU));
|
||||
// create timer
|
||||
StopWatchInterface *timerCPU = NULL, *timerGpu = NULL;
|
||||
sdkCreateTimer(&timerCPU);
|
||||
|
||||
float *d_A;
|
||||
double *d_b, *d_x, *d_x_new;
|
||||
cudaStream_t stream1;
|
||||
checkCudaErrors(cudaStreamCreateWithFlags(&stream1, cudaStreamNonBlocking));
|
||||
checkCudaErrors(cudaMalloc(&d_b, sizeof(double) * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_A, sizeof(float) * N_ROWS * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_x, sizeof(double) * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_x_new, sizeof(double) * N_ROWS));
|
||||
sdkStartTimer(&timerCPU);
|
||||
JacobiMethodCPU(A, b, conv_threshold, max_iter, &cnt, x);
|
||||
|
||||
checkCudaErrors(cudaMemsetAsync(d_x, 0, sizeof(double) * N_ROWS, stream1));
|
||||
checkCudaErrors(
|
||||
cudaMemsetAsync(d_x_new, 0, sizeof(double) * N_ROWS, stream1));
|
||||
checkCudaErrors(cudaMemcpyAsync(d_A, A, sizeof(float) * N_ROWS * N_ROWS,
|
||||
cudaMemcpyHostToDevice, stream1));
|
||||
checkCudaErrors(cudaMemcpyAsync(d_b, b, sizeof(double) * N_ROWS,
|
||||
cudaMemcpyHostToDevice, stream1));
|
||||
|
||||
sdkCreateTimer(&timerGpu);
|
||||
sdkStartTimer(&timerGpu);
|
||||
|
||||
double sumGPU = 0.0;
|
||||
if (gpumethod == 0) {
|
||||
sumGPU = JacobiMethodGpuCudaGraphExecKernelSetParams(
|
||||
d_A, d_b, conv_threshold, max_iter, d_x, d_x_new, stream1);
|
||||
} else if (gpumethod == 1) {
|
||||
sumGPU = JacobiMethodGpuCudaGraphExecUpdate(
|
||||
d_A, d_b, conv_threshold, max_iter, d_x, d_x_new, stream1);
|
||||
} else if (gpumethod == 2) {
|
||||
sumGPU = JacobiMethodGpu(d_A, d_b, conv_threshold, max_iter, d_x, d_x_new,
|
||||
stream1);
|
||||
}
|
||||
|
||||
sdkStopTimer(&timerGpu);
|
||||
printf("GPU Processing time: %f (ms)\n", sdkGetTimerValue(&timerGpu));
|
||||
|
||||
checkCudaErrors(cudaFree(d_b));
|
||||
checkCudaErrors(cudaFree(d_A));
|
||||
checkCudaErrors(cudaFree(d_x));
|
||||
checkCudaErrors(cudaFree(d_x_new));
|
||||
|
||||
checkCudaErrors(cudaFreeHost(A));
|
||||
checkCudaErrors(cudaFreeHost(b));
|
||||
|
||||
printf("&&&& jacobiCudaGraphs %s\n",
|
||||
(fabs(sum - sumGPU) < conv_threshold) ? "PASSED" : "FAILED");
|
||||
|
||||
return (fabs(sum - sumGPU) < conv_threshold) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
|
||||
void createLinearSystem(float *A, double *b) {
|
||||
int i, j;
|
||||
for (i = 0; i < N_ROWS; i++) {
|
||||
b[i] = 2.0 * N_ROWS;
|
||||
for (j = 0; j < N_ROWS; j++) A[i * N_ROWS + j] = 1.0;
|
||||
A[i * N_ROWS + i] = N_ROWS + 1.0;
|
||||
}
|
||||
}
|
||||
|
||||
void JacobiMethodCPU(float *A, double *b, float conv_threshold, int max_iter,
|
||||
int *num_iter, double *x) {
|
||||
double *x_new;
|
||||
x_new = (double *)calloc(N_ROWS, sizeof(double));
|
||||
int k;
|
||||
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
double sum = 0.0;
|
||||
// Compute error
|
||||
for (int i = 0; i < N_ROWS; i++) {
|
||||
double temp_dx = b[i];
|
||||
for (int j = 0; j < N_ROWS; j++) temp_dx -= A[i * N_ROWS + j] * x[j];
|
||||
temp_dx /= A[i * N_ROWS + i];
|
||||
x_new[i] += temp_dx;
|
||||
sum += fabs(temp_dx);
|
||||
double d = x[i] - 1.0;
|
||||
sum += fabs(d);
|
||||
}
|
||||
sdkStopTimer(&timerCPU);
|
||||
printf("CPU iterations : %d\n", cnt);
|
||||
printf("CPU error : %.3e\n", sum);
|
||||
printf("CPU Processing time: %f (ms)\n", sdkGetTimerValue(&timerCPU));
|
||||
|
||||
float *d_A;
|
||||
double *d_b, *d_x, *d_x_new;
|
||||
cudaStream_t stream1;
|
||||
checkCudaErrors(cudaStreamCreateWithFlags(&stream1, cudaStreamNonBlocking));
|
||||
checkCudaErrors(cudaMalloc(&d_b, sizeof(double) * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_A, sizeof(float) * N_ROWS * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_x, sizeof(double) * N_ROWS));
|
||||
checkCudaErrors(cudaMalloc(&d_x_new, sizeof(double) * N_ROWS));
|
||||
|
||||
checkCudaErrors(cudaMemsetAsync(d_x, 0, sizeof(double) * N_ROWS, stream1));
|
||||
checkCudaErrors(cudaMemsetAsync(d_x_new, 0, sizeof(double) * N_ROWS, stream1));
|
||||
checkCudaErrors(cudaMemcpyAsync(d_A, A, sizeof(float) * N_ROWS * N_ROWS, cudaMemcpyHostToDevice, stream1));
|
||||
checkCudaErrors(cudaMemcpyAsync(d_b, b, sizeof(double) * N_ROWS, cudaMemcpyHostToDevice, stream1));
|
||||
|
||||
sdkCreateTimer(&timerGpu);
|
||||
sdkStartTimer(&timerGpu);
|
||||
|
||||
double sumGPU = 0.0;
|
||||
if (gpumethod == 0) {
|
||||
sumGPU = JacobiMethodGpuCudaGraphExecKernelSetParams(d_A, d_b, conv_threshold, max_iter, d_x, d_x_new, stream1);
|
||||
}
|
||||
else if (gpumethod == 1) {
|
||||
sumGPU = JacobiMethodGpuCudaGraphExecUpdate(d_A, d_b, conv_threshold, max_iter, d_x, d_x_new, stream1);
|
||||
}
|
||||
else if (gpumethod == 2) {
|
||||
sumGPU = JacobiMethodGpu(d_A, d_b, conv_threshold, max_iter, d_x, d_x_new, stream1);
|
||||
}
|
||||
|
||||
for (int i = 0; i < N_ROWS; i++) x[i] = x_new[i];
|
||||
sdkStopTimer(&timerGpu);
|
||||
printf("GPU Processing time: %f (ms)\n", sdkGetTimerValue(&timerGpu));
|
||||
|
||||
if (sum <= conv_threshold) break;
|
||||
}
|
||||
*num_iter = k + 1;
|
||||
free(x_new);
|
||||
checkCudaErrors(cudaFree(d_b));
|
||||
checkCudaErrors(cudaFree(d_A));
|
||||
checkCudaErrors(cudaFree(d_x));
|
||||
checkCudaErrors(cudaFree(d_x_new));
|
||||
|
||||
checkCudaErrors(cudaFreeHost(A));
|
||||
checkCudaErrors(cudaFreeHost(b));
|
||||
|
||||
printf("&&&& jacobiCudaGraphs %s\n", (fabs(sum - sumGPU) < conv_threshold) ? "PASSED" : "FAILED");
|
||||
|
||||
return (fabs(sum - sumGPU) < conv_threshold) ? EXIT_SUCCESS : EXIT_FAILURE;
|
||||
}
|
||||
|
||||
void createLinearSystem(float *A, double *b)
|
||||
{
|
||||
int i, j;
|
||||
for (i = 0; i < N_ROWS; i++) {
|
||||
b[i] = 2.0 * N_ROWS;
|
||||
for (j = 0; j < N_ROWS; j++)
|
||||
A[i * N_ROWS + j] = 1.0;
|
||||
A[i * N_ROWS + i] = N_ROWS + 1.0;
|
||||
}
|
||||
}
|
||||
|
||||
void JacobiMethodCPU(float *A, double *b, float conv_threshold, int max_iter, int *num_iter, double *x)
|
||||
{
|
||||
double *x_new;
|
||||
x_new = (double *)calloc(N_ROWS, sizeof(double));
|
||||
int k;
|
||||
|
||||
for (k = 0; k < max_iter; k++) {
|
||||
double sum = 0.0;
|
||||
for (int i = 0; i < N_ROWS; i++) {
|
||||
double temp_dx = b[i];
|
||||
for (int j = 0; j < N_ROWS; j++)
|
||||
temp_dx -= A[i * N_ROWS + j] * x[j];
|
||||
temp_dx /= A[i * N_ROWS + i];
|
||||
x_new[i] += temp_dx;
|
||||
sum += fabs(temp_dx);
|
||||
}
|
||||
|
||||
for (int i = 0; i < N_ROWS; i++)
|
||||
x[i] = x_new[i];
|
||||
|
||||
if (sum <= conv_threshold)
|
||||
break;
|
||||
}
|
||||
*num_iter = k + 1;
|
||||
free(x_new);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user