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
|
//@HEADER
// ************************************************************************
//
// Kokkos v. 4.0
// Copyright (2022) National Technology & Engineering
// Solutions of Sandia, LLC (NTESS).
//
// Under the terms of Contract DE-NA0003525 with NTESS,
// the U.S. Government retains certain rights in this software.
//
// Part of Kokkos, under the Apache License v2.0 with LLVM Exceptions.
// See https://kokkos.org/LICENSE for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//@HEADER
#include <limits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <Kokkos_Core.hpp>
void checkSizes( int &N, int &M, int &S, int &nrepeat );
int main( int argc, char* argv[] )
{
int N = -1; // number of rows 2^12
int M = -1; // number of columns 2^10
int S = -1; // total size 2^22
int nrepeat = 100; // number of repeats of the test
// Read command line arguments.
for ( int i = 0; i < argc; i++ ) {
if ( ( strcmp( argv[ i ], "-N" ) == 0 ) || ( strcmp( argv[ i ], "-Rows" ) == 0 ) ) {
N = pow( 2, atoi( argv[ ++i ] ) );
printf( " User N is %d\n", N );
}
else if ( ( strcmp( argv[ i ], "-M" ) == 0 ) || ( strcmp( argv[ i ], "-Columns" ) == 0 ) ) {
M = pow( 2, atof( argv[ ++i ] ) );
printf( " User M is %d\n", M );
}
else if ( ( strcmp( argv[ i ], "-S" ) == 0 ) || ( strcmp( argv[ i ], "-Size" ) == 0 ) ) {
S = pow( 2, atof( argv[ ++i ] ) );
printf( " User S is %d\n", S );
}
else if ( strcmp( argv[ i ], "-nrepeat" ) == 0 ) {
nrepeat = atoi( argv[ ++i ] );
}
else if ( ( strcmp( argv[ i ], "-h" ) == 0 ) || ( strcmp( argv[ i ], "-help" ) == 0 ) ) {
printf( " y^T*A*x Options:\n" );
printf( " -Rows (-N) <int>: exponent num, determines number of rows 2^num (default: 2^12 = 4096)\n" );
printf( " -Columns (-M) <int>: exponent num, determines number of columns 2^num (default: 2^10 = 1024)\n" );
printf( " -Size (-S) <int>: exponent num, determines total matrix size 2^num (default: 2^22 = 4096*1024 )\n" );
printf( " -nrepeat <int>: number of repetitions (default: 100)\n" );
printf( " -help (-h): print this message\n\n" );
exit( 1 );
}
}
// Check sizes.
checkSizes( N, M, S, nrepeat );
Kokkos::initialize( argc, argv );
{
// For the sake of simplicity in this exercise, we're using std::malloc directly, but
// later on we'll learn a better way, so generally don't do this in Kokkos programs.
// Allocate y, x vectors and Matrix A:
auto y = static_cast<double*>(std::malloc(N * sizeof(double)));
auto x = static_cast<double*>(std::malloc(M * sizeof(double)));
auto A = static_cast<double*>(std::malloc(N * M * sizeof(double)));
// Initialize y vector.
Kokkos::parallel_for( "y_init", N, KOKKOS_LAMBDA ( int i ) {
y[ i ] = 1;
});
// Initialize x vector.
Kokkos::parallel_for( "x_init", M, KOKKOS_LAMBDA ( int i ) {
x[ i ] = 1;
});
// Initialize A matrix, note 2D indexing computation.
Kokkos::parallel_for( "matrix_init", N, KOKKOS_LAMBDA ( int j ) {
for ( int i = 0; i < M; ++i ) {
A[ j * M + i ] = 1;
}
});
// Timer products.
Kokkos::Timer timer;
for ( int repeat = 0; repeat < nrepeat; repeat++ ) {
// Application: <y,Ax> = y^T*A*x
double result = 0;
Kokkos::parallel_reduce( "yAx", N, KOKKOS_LAMBDA ( int j, double &update ) {
double temp2 = 0;
for ( int i = 0; i < M; ++i ) {
temp2 += A[ j * M + i ] * x[ i ];
}
update += y[ j ] * temp2;
}, result );
// Output result.
if ( repeat == ( nrepeat - 1 ) ) {
printf( " Computed result for %d x %d is %lf\n", N, M, result );
}
const double solution = (double) N * (double) M;
if ( result != solution ) {
printf( " Error: result( %lf ) != solution( %lf )\n", result, solution );
}
}
double time = timer.seconds();
// Calculate bandwidth.
// Each matrix A row (each of length M) is read once.
// The x vector (of length M) is read N times.
// The y vector (of length N) is read once.
// double Gbytes = 1.0e-9 * double( sizeof(double) * ( 2 * M * N + N ) );
double Gbytes = 1.0e-9 * double( sizeof(double) * ( M + M * N + N ) );
// Print results (problem size, time and bandwidth in GB/s).
printf( " N( %d ) M( %d ) nrepeat ( %d ) problem( %g MB ) time( %g s ) bandwidth( %g GB/s )\n",
N, M, nrepeat, Gbytes * 1000, time, Gbytes * nrepeat / time );
std::free(A);
std::free(y);
std::free(x);
}
Kokkos::finalize();
return 0;
}
void checkSizes( int &N, int &M, int &S, int &nrepeat ) {
// If S is undefined and N or M is undefined, set S to 2^22 or the bigger of N and M.
if ( S == -1 && ( N == -1 || M == -1 ) ) {
S = pow( 2, 22 );
if ( S < N ) S = N;
if ( S < M ) S = M;
}
// If S is undefined and both N and M are defined, set S = N * M.
if ( S == -1 ) S = N * M;
// If both N and M are undefined, fix row length to the smaller of S and 2^10 = 1024.
if ( N == -1 && M == -1 ) {
if ( S > 1024 ) {
M = 1024;
}
else {
M = S;
}
}
// If only M is undefined, set it.
if ( M == -1 ) M = S / N;
// If N is undefined, set it.
if ( N == -1 ) N = S / M;
printf( " Total size S = %d N = %d M = %d\n", S, N, M );
// Check sizes.
if ( ( S < 0 ) || ( N < 0 ) || ( M < 0 ) || ( nrepeat < 0 ) ) {
printf( " Sizes must be greater than 0.\n" );
exit( 1 );
}
if ( ( N * M ) != S ) {
printf( " N * M != S\n" );
exit( 1 );
}
}
|
