-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain.cpp
More file actions
67 lines (63 loc) · 1.7 KB
/
main.cpp
File metadata and controls
67 lines (63 loc) · 1.7 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
#include "mpi.h"
#include "stdio.h"
#include "time.h"
#include <cstdlib>
#include <cstring>
#include "jacobi.h"
Matrix SquareMatrix(const int n){
Matrix matrix = new float*[n];
for (int i = 0; i < n; i++) {
matrix[i] = new float[n];
}
srandom(time(0)+clock()+random());
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
matrix[i][j] = i + j + 1;//rand() % 4 + 1;
matrix[j][i] = matrix[i][j];
}
}
return matrix;
}
int main(int argc, char** argv){
// размерность передаем через аргументы командной строки
int n = std::atoi(argv[1]);
float start, end;
start = 0;
end = 0;
double elapsed_time = 0;
MPI_Init(&argc, &argv);
int rank;
MPI_Comm_rank(MPI_COMM_WORLD, &rank);
elapsed_time -= MPI_Wtime();
Matrix m = SquareMatrix(n);
PrintMatrix(m, n);
printf("\n");
ParallelJacobi(m, n, 1e-5);
elapsed_time += MPI_Wtime();
if (rank == 0) {
for (int i = 0; i < n; ++i) {
printf("%f ", m[i][i]);
}
printf("Dimension %i, time elapsed %f\n", n, elapsed_time);
MPI_Abort(MPI_COMM_WORLD, MPI_SUCCESS);
}
MPI_Finalize();
for (int i = 0; i < n; ++i) {
delete[] m[i];
}
delete[] m;
return 0;
}
/* Тестирование последовательного алгоритма Якоби*/
/*int main(int argc, char** argv){
int dimesions[8] = {8, 16, 32, 64, 128, 256, 512, 1024};
clock_t t;
double elapsed_secs;
for (int i = 0; i < 8; ++i) {
t = clock();
SerialJacobi(SquareMatrix(dimesions[i]), dimesions[i], 1e-5);
elapsed_secs = double(clock() - t) / CLOCKS_PER_SEC;
printf("Dimension %i, elapsed time %f\n", dimesions[i], elapsed_secs);
}
return 0;
}*/