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
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
// SPDX-FileCopyrightText: Copyright Contributors to the Kokkos project
/*! \brief file gups.cpp
An implementation of something like HPCC RandomAccess.
*/
#include "Kokkos_Core.hpp"
#include <algorithm>
#include <cstdio>
#include <chrono>
#include <cmath>
#include <cstdlib>
#include <numeric>
#include <random>
#define HLINE "-------------------------------------------------------------\n"
using Index = int64_t;
using Datum = int64_t;
using IndexView = Kokkos::View<Index*>;
using DataView = Kokkos::View<Datum*>;
using Clock = std::chrono::steady_clock;
using Duration = std::chrono::duration<double>;
using RandomDevice = std::random_device;
using RNG = std::mt19937;
IndexView randomized_indices(const Index indicesCount, const Index dataCount,
RNG& rng) {
// generate random indices 0..dataCount
std::uniform_int_distribution<Index> uid(0, dataCount);
std::vector<Index> indices(indicesCount);
std::generate(indices.begin(), indices.end(), [&]() { return uid(rng); });
// Copy to the default space and return
Kokkos::View<Index*, Kokkos::HostSpace, Kokkos::MemoryUnmanaged>
unmanaged_indices(indices.data(), indices.size());
IndexView dev_indices("dev_indices", indicesCount);
Kokkos::deep_copy(dev_indices, unmanaged_indices);
return dev_indices;
}
IndexView permuted_indices(const Index indicesCount, const Index dataCount,
RNG& rng) {
// create a permutation array of offsets into the data
std::vector<Index> perm(dataCount);
std::iota(perm.begin(), perm.end(), 0);
std::shuffle(perm.begin(), perm.end(), rng);
// indices is repeated copies of the permutation array
// (or the first entries of the permutation array if there
// are fewer indices than data elements)
IndexView dev_indices("dev_indices", indicesCount);
auto indices = Kokkos::create_mirror_view(dev_indices);
for (Index i = 0; i < Index(indices.extent(0)); ++i) {
indices(i) = perm[i % perm.size()];
}
// Copy to the default space and return
Kokkos::deep_copy(dev_indices, indices);
return dev_indices;
}
void run_gups(IndexView& indices, DataView& data, const Datum datum,
const bool performAtomics) {
if (performAtomics) {
Kokkos::parallel_for(
"bench-gups-atomic", indices.extent(0), KOKKOS_LAMBDA(const Index i) {
Kokkos::atomic_fetch_xor(&data[indices[i]], datum);
});
} else {
Kokkos::parallel_for(
"bench-gups-non-atomic", indices.extent(0),
KOKKOS_LAMBDA(const Index i) { data[indices[i]] ^= datum; });
}
Kokkos::fence();
}
enum class AccessPattern { random, permutation };
int run_benchmark(const Index indicesCount, const Index dataCount,
const int repeats, const bool useAtomics,
const AccessPattern pattern) {
constexpr auto arbitrary_seed = 20230913;
RNG rng(arbitrary_seed);
printf("Reports fastest timing per kernel\n");
printf("Creating Views...\n");
printf("Memory Sizes:\n");
printf("- Elements: %15" PRIu64 " (%12.4f MB)\n",
static_cast<uint64_t>(dataCount),
1.0e-6 * ((double)dataCount * (double)sizeof(Datum)));
printf("- Indices: %15" PRIu64 " (%12.4f MB)\n",
static_cast<uint64_t>(indicesCount),
1.0e-6 * ((double)indicesCount * (double)sizeof(Index)));
printf(" - Atomics: %15s\n", (useAtomics ? "Yes" : "No"));
printf("Benchmark kernels will be performed for %d iterations.\n", repeats);
printf(HLINE);
printf("Initializing Data...\n");
DataView data("data", dataCount);
Kokkos::parallel_for(
"init-data",
Kokkos::RangePolicy<Kokkos::DefaultExecutionSpace,
Kokkos::IndexType<Index>>(0, dataCount),
KOKKOS_LAMBDA(const Index i) { data[i] = 10101010101; });
printf("Starting benchmarking...\n");
double gupsTime = 0.0;
constexpr Datum datum = -1;
for (Index k = 0; k < repeats; ++k) {
IndexView indices;
switch (pattern) {
case AccessPattern::random: {
indices = randomized_indices(indicesCount, dataCount, rng);
break;
}
case AccessPattern::permutation: {
indices = permuted_indices(indicesCount, dataCount, rng);
break;
}
default: {
Kokkos::abort("unexpected mode");
}
}
auto start = Clock::now();
run_gups(indices, data, datum, useAtomics);
gupsTime += Duration(Clock::now() - start).count();
}
printf(HLINE);
printf("GUP/s Random: %18.6f\n",
(1.0e-9 * ((double)repeats) * (double)indicesCount) / gupsTime);
printf(HLINE);
return 0;
}
int main(int argc, char* argv[]) {
printf(HLINE);
printf("Kokkos GUPS Benchmark\n");
printf(HLINE);
Kokkos::initialize(argc, argv);
int64_t indices = 8192;
int64_t data = 33554432;
int64_t repeats = 10;
bool useAtomics = false;
AccessPattern pattern = AccessPattern::random;
for (int i = 1; i < argc; ++i) {
if (strcmp(argv[i], "--indices") == 0) {
indices = std::atoll(argv[i + 1]);
++i;
} else if (strcmp(argv[i], "--data") == 0) {
data = std::atoll(argv[i + 1]);
++i;
} else if (strcmp(argv[i], "--repeats") == 0) {
repeats = std::atoll(argv[i + 1]);
++i;
} else if (strcmp(argv[i], "--atomics") == 0) {
useAtomics = true;
} else if (strcmp(argv[i], "--pattern-permutation") == 0) {
pattern = AccessPattern::permutation;
}
}
const int rc = run_benchmark(indices, data, repeats, useAtomics, pattern);
Kokkos::finalize();
return rc;
}
|
