-
Notifications
You must be signed in to change notification settings - Fork 1
/
omp.cpp
157 lines (123 loc) · 3.28 KB
/
omp.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
#include <bits/stdc++.h>
#include <omp.h>
#include<fstream>
#include<chrono>
using namespace std;
using std::ifstream;
using namespace std::chrono;
void display(int n,vector<vector<int>>& x){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cout<<x[i][j]<<" ";
}
cout<<"\n";
}
cout<<"\n";
}
/*
void mulMat(vector<vector<int>>& mat1, vector<vector<int>>& mat2) {
//int rslt[R1][C2];
int n = mat1.size();
vector<vector<int>> rslt(n,vector<int>(n));
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
rslt[i][j] = 0;
for (int k = 0; k < n; k++){
rslt[i][j] += mat1[i][k] * mat2[k][j];
}
cout << rslt[i][j] << " ";
}
cout << endl;
}
}
*/
int main(int argc,char** argv){
ifstream indata;
int n=stoi(argv[1]);
string in=argv[2];
//int thread_num=stoi(argv[3]); //Enter thread number
indata.open(in);
vector<vector<int>> a(n,vector<int>(n));
vector<vector<int>> u(n,vector<int>(n,0));
vector<vector<int>> l(n,vector<int>(n,0));
vector<vector<int>> permut(n,vector<int>(n,0));
// inception point of timer
auto start = high_resolution_clock::now();
int num;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
indata>>num;
a[i][j]=num;
}
}
//l & u initialisation
#pragma omp parallel for collapse(2)
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(i==j){
l[i][j] = 1;
}
}
}
//p initialisation
vector<int> p(n,0);
#pragma omp parallel for
for(int i=0;i<n;i++){
p[i]=i;
}
for(int k=0; k<n; k++) {
int maxEle=0;
int k1;
for(int i=k; i<n; i++) {
if(maxEle < abs(a[i][k])) {
maxEle = abs(a[i][k]);
k1 = i;
}
}
if(maxEle==0) {
cout<<"Singular Matrix\n";
exit(0); //error
}
swap(p[k], p[k1]);
a[k].swap(a[k1]);
#pragma omp parallel for
for(int i=0; i<k; i++) {
swap(l[k][i], l[k1][i]);
}
u[k][k] = a[k][k];
#pragma omp parallel for
for(int i=k+1; i<n; i++) {
l[i][k] = a[i][k]/u[k][k];
u[k][i] = a[k][i];
}
#pragma omp parallel for collapse(2)
for(int i=k+1; i<n; i++) {
for(int j=k+1; j<n; j++) {
a[i][j] -= l[i][k]*u[k][j];
}
}
}
// Permutation matrix calculation
#pragma omp parallel for collapse(2)
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++){
if(j==p[i])
permut[i][j]=1;
else
permut[i][j]=0;
}
}
// timer ends here
auto stop = high_resolution_clock::now();
auto duration = duration_cast<microseconds>(stop - start);
cout<<duration.count()<<"\n";
//cout<<"\nOriginal matrix is :\n";
//display(n,a);
//cout<<"\nU matrix is :\n";
//display(n,u);
//cout<<"\nL matrix is :\n";
//display(n,l);
//cout<<"\nPermutation matrix is :\n";
//display(n,permut);
return 0;
}