-
Notifications
You must be signed in to change notification settings - Fork 109
/
p2p-tasks-openmp.cc
188 lines (167 loc) · 6.63 KB
/
p2p-tasks-openmp.cc
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
///
/// Copyright (c) 2013, Intel Corporation
///
/// Redistribution and use in source and binary forms, with or without
/// modification, are permitted provided that the following conditions
/// are met:
///
/// * Redistributions of source code must retain the above copyright
/// notice, this list of conditions and the following disclaimer.
/// * Redistributions in binary form must reproduce the above
/// copyright notice, this list of conditions and the following
/// disclaimer in the documentation and/or other materials provided
/// with the distribution.
/// * Neither the name of Intel Corporation nor the names of its
/// contributors may be used to endorse or promote products
/// derived from this software without specific prior written
/// permission.
///
/// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
/// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
/// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
/// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
/// COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
/// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
/// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
/// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
/// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
/// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
/// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
/// POSSIBILITY OF SUCH DAMAGE.
//////////////////////////////////////////////////////////////////////
///
/// NAME: Pipeline
///
/// PURPOSE: This program tests the efficiency with which point-to-point
/// synchronization can be carried out. It does so by executing
/// a pipelined algorithm on an m*n grid. The first array dimension
/// is distributed among the threads (stripwise decomposition).
///
/// USAGE: The program takes as input the
/// dimensions of the grid, and the number of iterations on the grid
///
/// <progname> <iterations> <m> <n>
///
/// The output consists of diagnostics to make sure the
/// algorithm worked, and of timing statistics.
///
/// FUNCTIONS CALLED:
///
/// Other than standard C functions, the following
/// functions are used in this program:
///
/// wtime()
///
/// HISTORY: - Written by Rob Van der Wijngaart, February 2009.
/// C99-ification by Jeff Hammond, February 2016.
/// C 11-ification by Jeff Hammond, May 2017.
///
//////////////////////////////////////////////////////////////////////
#include "prk_util.h"
#include "prk_openmp.h"
#include "p2p-kernel.h"
int main(int argc, char* argv[])
{
std::cout << "Parallel Research Kernels version " << PRKVERSION << std::endl;
#ifdef _OPENMP
std::cout << "C 11/OpenMP TASKS pipeline execution on 2D grid" << std::endl;
#else
std::cout << "C 11/Serial pipeline execution on 2D grid" << std::endl;
#endif
//////////////////////////////////////////////////////////////////////
// Process and test input parameters
//////////////////////////////////////////////////////////////////////
int iterations;
int m, n;
int mc, nc;
try {
if (argc < 4){
throw " <# iterations> <first array dimension> <second array dimension> [<first chunk dimension> <second chunk dimension>]";
}
// number of times to run the pipeline algorithm
iterations = std::atoi(argv[1]);
if (iterations < 1) {
throw "ERROR: iterations must be >= 1";
}
// grid dimensions
m = std::atoi(argv[2]);
n = std::atoi(argv[3]);
if (m < 1 || n < 1) {
throw "ERROR: grid dimensions must be positive";
} else if ( static_cast<size_t>(m)*static_cast<size_t>(n) > INT_MAX) {
throw "ERROR: grid dimension too large - overflow risk";
}
// grid chunk dimensions
mc = (argc > 4) ? std::atoi(argv[4]) : m;
nc = (argc > 5) ? std::atoi(argv[5]) : n;
if (mc < 1 || mc > m || nc < 1 || nc > n) {
std::cout << "WARNING: grid chunk dimensions invalid: " << mc << nc << " (ignoring)" << std::endl;
mc = m;
nc = n;
}
}
catch (const char * e) {
std::cout << e << std::endl;
return 1;
}
#ifdef _OPENMP
std::cout << "Number of threads (max) = " << omp_get_max_threads() << std::endl;
#endif
std::cout << "Number of iterations = " << iterations << std::endl;
std::cout << "Grid sizes = " << m << ", " << n << std::endl;
std::cout << "Grid chunk sizes = " << mc << ", " << nc << std::endl;
//////////////////////////////////////////////////////////////////////
// Allocate space and perform the computation
//////////////////////////////////////////////////////////////////////
double pipeline_time{0}; // silence compiler warning
double * RESTRICT grid = new double[m*n];
OMP_PARALLEL()
OMP_MASTER
{
// OMP_TASKLOOP( firstprivate(m,n) shared(grid) )
for (int i=0; i<m; i ) {
for (int j=0; j<n; j ) {
grid[i*n j] = 0.0;
}
}
OMP_TASKWAIT
for (int j=0; j<n; j ) {
grid[0*n j] = static_cast<double>(j);
}
for (int i=0; i<m; i ) {
grid[i*n 0] = static_cast<double>(i);
}
for (int iter = 0; iter<=iterations; iter ) {
if (iter==1) pipeline_time = prk::wtime();
for (int i=1; i<m; i =mc) {
for (int j=1; j<n; j =nc) {
OMP_TASK( firstprivate(m,n) shared(grid) depend(in:grid[(i-mc)*n j:1],grid[i*n (j-nc):1]) depend(out:grid[i*n j:1]) )
sweep_tile(i, std::min(m,i mc), j, std::min(n,j nc), n, grid);
}
}
OMP_TASKWAIT
grid[0*n 0] = -grid[(m-1)*n (n-1)];
}
pipeline_time = prk::wtime() - pipeline_time;
}
//////////////////////////////////////////////////////////////////////
// Analyze and output results.
//////////////////////////////////////////////////////////////////////
const double epsilon = 1.e-8;
auto corner_val = ((iterations 1.)*(n m-2.));
if ( (prk::abs(grid[(m-1)*n (n-1)] - corner_val)/corner_val) > epsilon) {
std::cout << "ERROR: checksum " << grid[(m-1)*n (n-1)]
<< " does not match verification value " << corner_val << std::endl;
return 1;
}
#ifdef VERBOSE
std::cout << "Solution validates; verification value = " << corner_val << std::endl;
#else
std::cout << "Solution validates" << std::endl;
#endif
auto avgtime = pipeline_time/iterations;
std::cout << "Rate (MFlops/s): "
<< 2.0e-6 * ( (m-1.)*(n-1.) )/avgtime
<< " Avg time (s): " << avgtime << std::endl;
return 0;
}