Repository navigation
Expand file tree
/
Copy pathmatrix.hpp
More file actions
91 lines (76 loc) · 2.37 KB
/
Copy pathmatrix.hpp
File metadata and controls
91 lines (76 loc) · 2.37 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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <algorithm> // for std::max
#include <cassert>
#include <cstdio>
#include <chrono>
#include <iostream>
#include <iomanip>
#include <thread>
#include <random>
#include <cmath>
inline int M, N;
inline int B;
inline int MB;
inline int NB;
inline double **matrix {nullptr};
// nominal operations
inline double calc(double v0, double v1) {
return (v0 == v1) ? std::pow(v0/v1, 4.0f) : std::max(v0,v1);
//return std::max(v0, v1);
}
// initialize the matrix
inline void init_matrix(){
matrix = new double *[M];
for ( int i = 0; i < M; ++i ) matrix[i] = new double [N];
for(int i=0; i<M; ++i){
for(int j=0; j<N ; ++j){
matrix[i][j] = i*N + j;
}
}
}
// destroy the matrix
inline void destroy_matrix() {
for ( int i = 0; i < M; ++i ) {
delete [] matrix[i];
}
delete [] matrix;
}
//computation given block row index i, block col index j
inline int block_computation(int i, int j){
// When testing taskflow
return i + j;
//int start_i = i*B;
//int end_i = (i*B+B > M) ? M : i*B+B;
//int start_j = j*B;
//int end_j = (j*B+B > N) ? N : j*B+B;
//for ( int ii = start_i; ii < end_i; ++ii ) {
// for ( int jj = start_j; jj < end_j; ++jj ) {
// double v0 = ii == 0 ? 0 : matrix[ii-1][jj];
// double v1 = jj == 0 ? 0 : matrix[ii][jj-1];
// matrix[ii][jj] = ii==0 && jj==0 ? 1 : calc(v0,v1);
// }
//}
}
//computation given block row index i, block col index j
inline void framework_computation(int i, int j){
// When testing framework
int start_i = i*B;
int end_i = (i*B+B > M) ? M : i*B+B;
int start_j = j*B;
int end_j = (j*B+B > N) ? N : j*B+B;
for ( int ii = start_i; ii < end_i; ++ii ) {
for ( int jj = start_j; jj < end_j; ++jj ) {
matrix[ii][jj] += ii == 0 ? 0.0 : matrix[ii-1][jj];
matrix[ii][jj] += ii >= M-1 ? 0.0 : matrix[ii+1][jj];
matrix[ii][jj] += jj == 0 ? 0.0 : matrix[ii][jj-1];
matrix[ii][jj] += jj >= N-1 ? 0.0 : matrix[ii][jj+1];
matrix[ii][jj] *= 0.25;
//matrix[ii][jj] = matrix[ii][jj];
}
}
}
std::chrono::microseconds measure_time_taskflow(unsigned);
std::chrono::microseconds measure_time_omp(unsigned);
std::chrono::microseconds measure_time_tbb(unsigned);
std::chrono::microseconds measure_time_taskflow(unsigned, unsigned);
std::chrono::microseconds measure_time_omp(unsigned, unsigned);
std::chrono::microseconds measure_time_tbb(unsigned, unsigned);