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
|
// @HEADER
// ************************************************************************
//
// Intrepid2 Package
// Copyright (2007) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. 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.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "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 SANDIA CORPORATION OR THE
// 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.
//
// Questions? Contact Kyungjoo Kim (kyukim@sandia.gov), or
// Mauro Perego (mperego@sandia.gov)
//
// ************************************************************************
// @HEADER
/** \file test_01.cpp
\brief Performance test comparing dynrankview overhead
\author Created by Kyungjoo Kim.
*/
#include "Intrepid2_config.h"
#include "Intrepid2_Types.hpp"
#include "Intrepid2_Utils.hpp"
#include "Teuchos_oblackholestream.hpp"
#include "Teuchos_RCP.hpp"
#include "Teuchos_ScalarTraits.hpp"
namespace Intrepid2 {
namespace Test {
namespace Serial {
// compute determinant for rank 2 array
template<typename inMatViewType>
KOKKOS_FORCEINLINE_FUNCTION
typename inMatViewType::value_type
det( const inMatViewType inMat ) {
const auto dim = inMat.extent(0);
return ( dim == 3 ? ( inMat(0,0) * inMat(1,1) * inMat(2,2) +
inMat(1,0) * inMat(2,1) * inMat(0,2) +
inMat(2,0) * inMat(0,1) * inMat(1,2) -
inMat(2,0) * inMat(1,1) * inMat(0,2) -
inMat(0,0) * inMat(2,1) * inMat(1,2) -
inMat(1,0) * inMat(0,1) * inMat(2,2) ) :
dim == 2 ? ( inMat(0,0) * inMat(1,1) -
inMat(0,1) * inMat(1,0) ) :
/**/ ( inMat(0,0) ) );
}
}
template<typename detArrayViewType,
typename inMatViewType>
struct F_det {
detArrayViewType _detArray;
inMatViewType _inMats;
KOKKOS_INLINE_FUNCTION
F_det( detArrayViewType detArray_,
inMatViewType inMats_ )
: _detArray(detArray_), _inMats(inMats_) {}
KOKKOS_INLINE_FUNCTION
void operator()(const ordinal_type iter) const {
// comapring left and right stride for serial
// 15 % difference, right stride access is better (of course)
// right
const auto stride = _inMats.extent(1);
const auto
i = iter / stride,
j = iter % stride;
// left
// const auto stride = _inMats.extent(0);
// const auto
// i = iter % stride,
// j = iter / stride;
// current implementation subview overhead exists
// {
// auto mat = Kokkos::subview(_inMats, i, j, Kokkos::ALL(), Kokkos::ALL());
// _detArray(i, j) = Serial::det(mat);
// }
// direct access (base is 8 rank)
{
const auto dim = _inMats.extent(2);
const auto val = ( dim == 3 ? ( _inMats(i,j,0,0) * _inMats(i,j,1,1) * _inMats(i,j,2,2) +
_inMats(i,j,1,0) * _inMats(i,j,2,1) * _inMats(i,j,0,2) +
_inMats(i,j,2,0) * _inMats(i,j,0,1) * _inMats(i,j,1,2) -
_inMats(i,j,2,0) * _inMats(i,j,1,1) * _inMats(i,j,0,2) -
_inMats(i,j,0,0) * _inMats(i,j,2,1) * _inMats(i,j,1,2) -
_inMats(i,j,1,0) * _inMats(i,j,0,1) * _inMats(i,j,2,2) ) :
dim == 2 ? ( _inMats(i,j,0,0) * _inMats(i,j,1,1) -
_inMats(i,j,0,1) * _inMats(i,j,1,0) ) :
/**/ ( _inMats(i,j,0,0) ) );
_detArray(i, j) = val;
}
}
};
template<typename ValueType, typename DeviceSpaceType>
int DynRankView_PerfTest01(const ordinal_type nworkset,
const ordinal_type C,
const ordinal_type P,
const ordinal_type D,
const bool verbose) {
Teuchos::RCP<std::ostream> verboseStream;
Teuchos::oblackholestream bhs; // outputs nothing
if (verbose)
verboseStream = Teuchos::rcp(&std::cout, false);
else
verboseStream = Teuchos::rcp(&bhs, false);
Teuchos::oblackholestream oldFormatState;
oldFormatState.copyfmt(std::cout);
typedef typename
Kokkos::Impl::is_space<DeviceSpaceType>::host_mirror_space::execution_space HostSpaceType ;
*verboseStream << "DeviceSpace:: "; DeviceSpaceType::print_configuration(*verboseStream, false);
*verboseStream << "HostSpace:: "; HostSpaceType::print_configuration(*verboseStream, false);
std::cout
<< "===============================================================================\n"
<< " Performance Test for measuring DynRankView Overhead \n"
<< " # of workset = " << nworkset << "\n"
<< " Test Array Structure (C,P,D) = " << C << ", " << P << ", " << D << "\n"
<< "===============================================================================\n";
Kokkos::Impl::Timer timer;
double t_dynrankview[20] = {}, t_view[20] = {};
int errorFlag = 0, itest = 0;
*verboseStream
<< "\n"
<< "===============================================================================\n"
<< "TEST 1: RealSpaceTools det \n"
<< " input (C,P,D,D), output (C,P) \n"
<< "===============================================================================\n";
try {
*verboseStream << " -> Testing View \n";
{ // Kokkos View
typedef Kokkos::View<ValueType****,DeviceSpaceType> inViewType;
typedef Kokkos::View<ValueType**, DeviceSpaceType> outViewType;
//typedef Kokkos::View<ValueType********,DeviceSpaceType> inViewType;
//typedef Kokkos::View<ValueType********, DeviceSpaceType> outViewType;
typedef F_det<outViewType,inViewType> FunctorType;
inViewType in ("inView", C,P,D,D);
outViewType out("outView", C,P);
const auto loopSize = C*P;
Kokkos::RangePolicy<DeviceSpaceType,Kokkos::Schedule<Kokkos::Static> > policy(0, loopSize);
Kokkos::deep_copy(in, 1.0);
DeviceSpaceType().fence();
timer.reset();
for (ordinal_type i=0;i<nworkset;++i)
Kokkos::parallel_for( policy, FunctorType(out, in) );
DeviceSpaceType().fence();
t_view[itest] = timer.seconds();
}
*verboseStream << " -> Testing DynRankView \n";
{ // Kokkos DynRankView
typedef Kokkos::DynRankView<ValueType,DeviceSpaceType> ViewType;
typedef F_det<ViewType,ViewType> FunctorType;
ViewType in("inDynRankView", C,P,D,D), out("outDynRankView", C,P);
const auto loopSize = C*P;
Kokkos::RangePolicy<DeviceSpaceType,Kokkos::Schedule<Kokkos::Static> > policy(0, loopSize);
Kokkos::deep_copy(in, 1.0);
DeviceSpaceType().fence();
timer.reset();
for (ordinal_type i=0;i<nworkset;++i)
Kokkos::parallel_for( policy, FunctorType(out, in) );
DeviceSpaceType().fence();
t_dynrankview[itest] = timer.seconds();
}
} catch (std::exception err) {
*verboseStream << "UNEXPECTED ERROR !!! ----------------------------------------------------------\n";
*verboseStream << err.what() << '\n';
*verboseStream << "-------------------------------------------------------------------------------" << "\n\n";
errorFlag = -1000;
}
++itest;
std::cout
<< "===============================================================================\n";
for (auto i=0;i<itest;++i) {
const auto ratio = (t_view[i]/t_dynrankview[i]);
std::cout
<< "TEST " << i
<< ": t_view = " << t_view[i]
<< ", t_dynrankview = " << t_dynrankview[i]
<< ", ratio (v/drv) = " << ratio << "\n";
const auto tol = 0.95;
if (ratio < tol) {
std::cout << "Performance test failed as view/dynrankview is below " << tol << std::endl;
errorFlag = -1;
}
}
std::cout
<< "===============================================================================\n";
if (errorFlag != 0)
std::cout << "End Result: TEST FAILED\n";
else
std::cout << "End Result: TEST PASSED\n";
// reset format state of std::cout
std::cout.copyfmt(oldFormatState);
return errorFlag;
}
} // end of namespace TEST
} // end of namespace Intrepid2
|
