-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathshared_mem.cu
215 lines (163 loc) · 4.51 KB
/
shared_mem.cu
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
#include <cuda.h>
#include <stdio.h>
#include <math.h>
#include<sys/time.h>
//#define N 6
__global__ void add( float *a, float *b, float *c) {
int tid = blockIdx.x; //Handle the data at the index
c[tid] = a[tid] + b[tid];
}
__global__ void scale(float *a, int size, int index){
int i;
int start=(index*size+index);
int end=(index*size+size);
for(i=start+1;i<end;i++){
a[i]=(a[i]/a[start]);
}
}
__global__ void reduce(float *a, int size, int index, int b_size){
extern __shared__ float pivot[];
int i;
int tid=threadIdx.x;
int bid=blockIdx.x;
int block_size=b_size;
int pivot_start=(index*size+index);
int pivot_end=(index*size+size);
int start;
int end;
int pivot_row;
int my_row;
if(tid==0){
for(i=index;i<size;i++) pivot[i]=a[(index*size)+i];
}
__syncthreads();
pivot_row=(index*size);
my_row=(((block_size*bid) + tid)*size);
start=my_row+index;
end=my_row+size;
if(my_row >pivot_row){
for(i=start+1;i<end;i++){
// a[i]=a[i]-(a[start]*a[(index*size)+i]);
// a[i]=a[i]-(a[start]*a[(index*size)+(index+(i-start))]);
a[i]=a[i]-(a[start]*pivot[(i-my_row)]);
}
}
}
int main(int argc, char *argv[]){
float *a;
float *c;
float error;
int N;
int flag=0;
float **result;
float **b;
int blocks;
float *dev_a;
int i;
int j;
int k;
float l1;
float u1;
double start;
double end;
struct timeval tv;
N=atoi(argv[1]);
//allocate memory on CPU
a=(float *)malloc(sizeof(float)*N*N);
c=(float *)malloc(sizeof(float)*N*N);
result=(float **)malloc(sizeof(float *)*N);
b=(float **)malloc(sizeof(float *)*N);
for(i=0;i<N;i++){
result[i]=(float *)malloc(sizeof(float)*N);
b[i]=(float *)malloc(sizeof(float)*N);
}
//allocate the memory on the GPU
cudaMalloc ( (void**)&dev_a, N*N* sizeof (float) );
srand((unsigned)2);
//fill the arrays 'a' on the CPU
for ( i = 0; i <= (N*N); i++) {
a[i] =((rand()%10)+1);
}
printf("Matrix a is :\n");
/*for(i=0; i<(N*N); i++){
if(i%N==0)
printf("\n %f ", a[i]);
else printf("%lf ",a[i]);
}*/
cudaMemcpy(dev_a,a,N*N*sizeof(float), cudaMemcpyHostToDevice);//copy array to device memory
gettimeofday(&tv,NULL);
start=tv.tv_sec;
/*Perform LU Decomposition*/
printf("\n==========================================================\n");
for(i=0;i<N;i++){
scale<<<1,1>>>(dev_a,N,i);
// blocks= ((N-i-1)/512)+1;
blocks=((N/512));
// printf("Number of blocks rxd : %d \n",blocks);
reduce<<<blocks,512,N*sizeof(float)>>>(dev_a,N,i,512);
}
/*LU decomposition ends here*/
gettimeofday(&tv,NULL);
end=tv.tv_sec;
cudaMemcpy( c, dev_a, N*N*sizeof(float),cudaMemcpyDeviceToHost );//copy array back to host
printf("\nThe time for LU decomposition is %lf \n",(end-start));
//display the results
printf("\nCopied matrix C is \n");
/* for ( i = 0; i < (N*N); i++) {
if(i%N==0)
printf( "\n%f ", c[i]);
else printf("%lf ",c[i]);
}*/
printf("\n");
/*copy the result matrix into explicit 2D matrix for verification*/
for(i=0;i<N;i++){
for(j=0;j<N;j++){
result[i][j]=c[i*N+j];
}
}
/* printf("The result matrix\n");
for(i=0;i<N;i++){
for(j=0;j<N;j++){
printf("%lf ",result[i][j]);
}
printf("\n");
}*/
printf("=======================================================");
printf("\n Performing inplace verification \n");
/*Inplace verification step*/
/* for(i=0;i<N;i++){
for(j=0;j<N;j++){
b[i][j]=0;
for(k=0;k<N;k++){
if(i>=k)l1=result[i][k];
else l1=0;
if(k==j)u1=1;
else if(k<j)u1=result[k][j];//figured it out
else u1=0.0;
b[i][j]=b[i][j]+(l1*u1);
}
}
}
for(i=0;i<N;i++){
for(j=0;j<N;j++){
error=abs(a[(i*N+j)]-b[i][j]);
if(error> 1 ) {
// printf("No match occured at %d %d Error is %lf \n ", i, j, abs(a[(i*N+j)]-b[i][j]));
flag =flag+1;
}
}
}*/
if(flag==0) printf("Match");
else printf("No Matchs %d \n",flag);
printf("\n==================================================\n");
printf("\nThe b matrix\n");
/*for(i=0;i<N;i++){
for(j=0;j<N;j++){
printf("%lf ",b[i][j]);
}
printf("\n");
}*/
//free the memory allocated on the GPU
cudaFree( dev_a );
return 0;
}