-
Notifications
You must be signed in to change notification settings - Fork 0
/
hpc.cpp
359 lines (311 loc) · 9.02 KB
/
hpc.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
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
/*
High performance computing :Project - Convolution of an Image using MPI
NAme: Sai Karthikeya Vemuri
Matrikel Nr: 65124
Professor in charge: Dr.Oliver Rheinbach
*/
//Include all the headers
#include <iostream>
#include <cstdlib>
#include <fstream>
#include <sstream>
#include <vector>
#include <mpi.h>
class Convolution
{
/*
Implementation of convolution as a class
*/
private:
//private data members, for every convolution object, there is a need of five data holders
//image : 2d vector in which the image is stored
//kernel: The kernel operation matrix
//output: The output result of convolution
//rows,columns: number of pixels of image
std::vector<std::vector<int>> image;
std::vector<std::vector<float>> kernel;
std::vector<std::vector<int>> output;
int rows;
int columns;
public:
//constructor to initialize data variables
Convolution(std::vector<std::vector<int>> image_input,std::vector<std::vector<float>> kernel_input,int rows,int columns)
: rows(rows),columns(columns)
{
image = image_input;
kernel= kernel_input;
output.resize(rows, std::vector<int>(columns,0));
}
int index_number(int a, int max)
{
//This function takes in a relative number in kernel operation and max number in that dimension and gives an index according to periodic boundary condition
int index;
if (a < 0){
index = max + a;
}
else if (a >= max){
index = a-max;
}
else{
index = a;
}
return index;
}
std::vector<std::vector<int>> Convolute_Serial()
{
//This method does convolution operation in serial manner and outputs the result
int indexr,indexc,a,b;
float sum;
//std::cout<<"Go ahead, program the convolution";
for(int x = 0; x<rows;++x)
{
for(int y=0; y<columns;++y)
{
sum=0;
for(int i=0;i<3;++i)
{
for(int j=0;j<3;j++)
{
a = x +i -1;
b = y+j -1;
indexr= index_number(a,rows);
indexc= index_number(b,columns);
sum += image[indexr][indexc] * kernel[i][j];
}
}
if(sum>255) {sum=255;} else if(sum<0){sum=0;}
output[x][y]=sum;
}
}
return output;
}
std::vector<std::vector<int>> Convolute_Parallel()
{
//This method does convolution using MPI processes.
// The 2d array is scattered into chunks of smaller arrays to processes from root and halo rows are communicated through Isend and Irecv
//Convolution is done for these smaller chunks and gathered at root again to get the final matrix after convolution
int rank;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
int p;
MPI_Comm_size(MPI_COMM_WORLD, &p);
MPI_Barrier(MPI_COMM_WORLD);
if(p==1 || p>rows){
//std::cout<<"Serial done";
return Convolute_Serial();}
else
{
//std::cout<<"In else \n";
int rows_p = rows/p;
int temp_array[rows][columns];
for (int i =0; i < rows; ++i)
{
for (int j = 0; j < columns; ++j) {
temp_array[i][j] = image[i][j];
}
}
//std::cout<<"Temp array copied succesfully \n";
int dest1, dest2, src1, src2;
int recHalo1[columns], recHalo2[columns];
int sendHalo1[columns], sendHalo2[columns];
std::vector<std::vector<int>> matrixHalo;
int matrixHaloArr[rows_p][columns];
float convProcMatrix[rows_p][columns];
float FinalMatrix [rows][columns];
MPI_Scatter(temp_array, rows_p*columns, MPI_INT,
&matrixHaloArr, rows_p*columns, MPI_INT, 0, MPI_COMM_WORLD);
//std::cout<<"Done scattering \n";
MPI_Request requestHandle[2];
for (int i = 0; i < columns; i++){
sendHalo1[i] = matrixHaloArr[0][i];
sendHalo2[i] = matrixHaloArr[rows_p - 1][i];
}
//std::cout<<"Done Halo\n";
if (p == 1) {//if there is only 1 process
dest1 = 0;
dest2 = 0;
src1 = 0;
src2 = 0;
}
else {//if more than one process are there
if (rank == 0) {
dest1 = p - 1;
dest2 = rank + 1;
src1 = p - 1;
src2 = rank + 1;
} else if (rank == p - 1) {
dest1 = rank - 1;
dest2 = 0;
src1 = rank - 1;
src2 = 0;
} else {
dest1 = rank - 1;
dest2 = rank + 1;
src1 = rank - 1;
src2 = rank + 1;
}
}
MPI_Isend(&sendHalo1, columns, MPI_INT, dest1, 111, MPI_COMM_WORLD, &requestHandle[0]);
MPI_Isend(&sendHalo2, columns, MPI_INT, dest2, 112, MPI_COMM_WORLD, &requestHandle[1]);
MPI_Irecv(&recHalo1, columns, MPI_INT, src1, 112, MPI_COMM_WORLD, &requestHandle[1]);
MPI_Irecv(&recHalo2, columns, MPI_INT, src2, 111, MPI_COMM_WORLD, &requestHandle[0]);
MPI_Waitall(2, requestHandle, MPI_STATUSES_IGNORE);
//std::cout<<"Done isend and irecv\n";
matrixHalo.resize(rows_p + 2, std::vector<int>(columns, 0));
// //convProcMatrix.resize(rows_p, std::vector<int>(columns, 0));
for(int row=0;row<rows_p+2;row++){
for (int i = 0; i < columns; i++){
if(row==0){
matrixHalo[0][i] = recHalo1[i];
}
else if(row==rows_p+1){
matrixHalo[rows_p+1][i] = recHalo2[i];
}
else{
matrixHalo[row][i]=matrixHaloArr[row-1][i];
}
}
}
int a,b,indexr,indexc;
float sum;
for(int x = 1; x<rows_p+1;++x)
{
for(int y=0; y<columns;++y)
{
sum=0;
for(int i=0;i<3;++i)
{
for(int j=0;j<3;++j)
{
a = x +i -1;
b = y +j -1;
indexr= index_number(a,rows);
indexc= index_number(b,columns);
sum += matrixHalo[indexr][indexc] * kernel[i][j];
}
}
if(sum>255) {sum=255;} else if(sum<0){sum=0;} convProcMatrix[x-1][y]=sum;
}
}
MPI_Barrier(MPI_COMM_WORLD);
//std::cout<<"Done convolution process \n";
MPI_Gather(&convProcMatrix, rows_p*columns, MPI_FLOAT, FinalMatrix,rows_p*columns , MPI_FLOAT, 0, MPI_COMM_WORLD);
if(rank==0)
{
std::cout<<"Done gathering\n";
for(int i = 0;i<rows;++i){
for(int j=0;j<columns;++j){
output[i][j] = FinalMatrix[i][j];
}
}
}
MPI_Barrier(MPI_COMM_WORLD);
return output;
}
}
void create_ofile(std::string& ofilename)
{
//Method to write a 2d vector to a pgm file
std::ofstream outfile(ofilename);
if(outfile.is_open())
{
outfile<<"P2"<<"\n";
outfile<<rows<<" "<<columns<<"\n";
outfile<<255<<"\n";
for(int i =0;i<rows;i++){
for (int j = 0;j<columns; j++){
outfile<<output[i][j]<<" ";
}
outfile<<"\n";
}
}
outfile.close();
}
//Destructor
~Convolution() {}
};
//Main function, execution starts here
int main(int argc,char **argv)
{
MPI_Init(&argc,&argv);
int rank;
int pcom;
double t1, t2;
t1 = MPI_Wtime();
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
MPI_Comm_size(MPI_COMM_WORLD, &pcom);
int row = 0, col = 0, numrows =512 , numcols = 512, greyval = 255;
std::vector<std::vector<int>> array;
array.resize(numrows, std::vector<int>(numcols,0));
if(rank==0){
std::ifstream infile("512.pgm");
std::stringstream ss;
std::string inputLine = "";
// First line : version
getline(infile,inputLine);
if(inputLine.compare("P2") != 0) std::cerr << "Version error" << "\n";
else std::cout << "Version : " << inputLine << "\n";
// Continue with a stringstream
ss << infile.rdbuf();
// Third line : size
ss >> numcols >> numrows >> greyval;
std::cout << numcols << " columns and " << numrows << " rows" << "\n";
// Following lines : data
for(row = 0; row < numrows; ++row)
for (col = 0; col < numcols; ++col) ss >> array[row][col];
std::cout<<"The file is read only in root"<<"/n";
infile.close();
}
//Define kernels
std::vector<std::vector<float>> blur
{
{0.0625,0.125,0.0625},
{0.125,0.25,0.125},
{0.0625,0.125,0.0625}
};
std::vector<std::vector<float>> edge
{
{-1,-1,-1},
{-1,8,-1},
{-1,-1,-1}
};
std::vector<std::vector<float>> sharp
{
{0,-1,0},
{-1,5,-1},
{0,-1,0}
};
std::vector<std::vector<float>> identity
{
{0,0,0},
{0,1,0},
{0,0,0}
};
//Task 1:Edge
Convolution C(array,blur,numrows,numcols);
array=C.Convolute_Parallel();
if(rank == 0){
std::string oname="512_parallel_blur.pgm";
C.create_ofile(oname);
t2 = MPI_Wtime();
printf( "Elapsed time is %f\n", t2 - t1 );
}
/*
//Task2 : 5x Blur
for(int k =0;k<5;k++)
{
Convolution C(array,blur,numrows,numcols);
array=C.Convolute_Serial();
if(k==4)
{
Convolution C(array,sharp,numrows,numcols);
array=C.Convolute_Serial();
Convolution C1(array,edge,numrows,numcols);
array=C1.Convolute_Serial();
std::string oname="512pix_5xBlur_Edge_Sharp.pgm";
C1.create_ofile(oname);
}
}
*/
MPI_Finalize();
return 0;
}