-
Notifications
You must be signed in to change notification settings - Fork 109
/
nstream-hipstl.cc
173 lines (149 loc) · 6.49 KB
/
nstream-hipstl.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
///
/// Copyright (c) 2020, 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: nstream
///
/// PURPOSE: To compute memory bandwidth when adding a vector of a given
/// number of double precision values to the scalar multiple of
/// another vector of the same length, and storing the result in
/// a third vector.
///
/// USAGE: The program takes as input the number
/// of iterations to loop over the triad vectors and
/// the length of the vectors.
///
/// <progname> <# iterations> <vector length>
///
/// The output consists of diagnostics to make sure the
/// algorithm worked, and of timing statistics.
///
/// NOTES: Bandwidth is determined as the number of words read, plus the
/// number of words written, times the size of the words, divided
/// by the execution time. For a vector length of N, the total
/// number of words read and written is 4*N*sizeof(double).
///
/// HISTORY: This code is loosely based on the Stream benchmark by John
/// McCalpin, but does not follow all the Stream rules. Hence,
/// reported results should not be associated with Stream in
/// external publications
///
/// Converted to C 11 by Jeff Hammond, November 2017.
///
//////////////////////////////////////////////////////////////////////
#include "prk_util.h"
#include "prk_hip.h"
int main(int argc, char * argv[])
{
std::cout << "Parallel Research Kernels version " << PRKVERSION << std::endl;
std::cout << "C 11/HIPSTL STREAM triad: A = B scalar * C" << std::endl;
//////////////////////////////////////////////////////////////////////
/// Read and test input parameters
//////////////////////////////////////////////////////////////////////
int iterations;
size_t length;
try {
if (argc < 3) {
throw "Usage: <# iterations> <vector length>";
}
iterations = std::atoi(argv[1]);
if (iterations < 1) {
throw "ERROR: iterations must be >= 1";
}
length = std::atol(argv[2]);
if (length <= 0) {
throw "ERROR: vector length must be positive";
}
}
catch (const char * e) {
std::cout << e << std::endl;
return 1;
}
std::cout << "Number of iterations = " << iterations << std::endl;
std::cout << "Vector length = " << length << std::endl;
//////////////////////////////////////////////////////////////////////
// Allocate space and perform the computation
//////////////////////////////////////////////////////////////////////
auto nstream_time = 0.0;
thrust::device_vector<double> A(length);
thrust::device_vector<double> B(length);
thrust::device_vector<double> C(length);
double scalar(3);
{
thrust::fill(thrust::device, A.begin(), A.end(), 0.0);
thrust::fill(thrust::device, B.begin(), B.end(), 2.0);
thrust::fill(thrust::device, C.begin(), C.end(), 2.0);
auto nstream = [=] __host__ __device__ (thrust::tuple<double&,double,double> t) {
thrust::get<0>(t) = thrust::get<1>(t) scalar * thrust::get<2>(t);
};
for (int iter = 0; iter<=iterations; iter ) {
if (iter==1) nstream_time = prk::wtime();
thrust::for_each( thrust::device,
thrust::make_zip_iterator(thrust::make_tuple(A.begin(), B.begin(), C.begin())),
thrust::make_zip_iterator(thrust::make_tuple(A.end() , B.end() , C.end())),
nstream);
prk::HIP::check( hipDeviceSynchronize() );
}
nstream_time = prk::wtime() - nstream_time;
}
//////////////////////////////////////////////////////////////////////
/// Analyze and output results
//////////////////////////////////////////////////////////////////////
double ar(0);
double br(2);
double cr(2);
for (int i=0; i<=iterations; i ) {
ar = br scalar * cr;
}
ar *= length;
//double asum = thrust::reduce(A.begin(), A.end(), 0.0, thrust::plus<double>());
double asum = thrust::transform_reduce(A.begin(),
A.end(),
[=] __host__ __device__ (double x) -> double { return fabs(x); },
0.0,
thrust::plus<double>());
double epsilon(1.e-8);
if (prk::abs(ar-asum)/asum > epsilon) {
std::cout << "Failed Validation on output array\n"
<< std::setprecision(16)
<< " Expected checksum: " << ar << "\n"
<< " Observed checksum: " << asum << std::endl;
std::cout << "ERROR: solution did not validate" << std::endl;
return 1;
} else {
std::cout << "Solution validates" << std::endl;
double avgtime = nstream_time/iterations;
double nbytes = 4.0 * length * sizeof(double);
std::cout << "Rate (MB/s): " << 1.e-6*nbytes/avgtime
<< " Avg time (s): " << avgtime << std::endl;
}
return 0;
}