forked from ROCm/rocPRIM
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbenchmark_block_histogram.cpp
271 lines (236 loc) · 8.93 KB
/
benchmark_block_histogram.cpp
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
268
269
270
271
// MIT License
//
// Copyright (c) 2017-2024 Advanced Micro Devices, Inc. All rights reserved.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
#include "benchmark_utils.hpp"
// CmdParser
#include "cmdparser.hpp"
// Google Benchmark
#include <benchmark/benchmark.h>
// HIP API
#include <hip/hip_runtime.h>
// rocPRIM
#include <rocprim/block/block_histogram.hpp>
#include <rocprim/block/block_load_func.hpp>
#include <rocprim/block/block_store_func.hpp>
#include <iostream>
#include <limits>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#ifndef DEFAULT_N
const size_t DEFAULT_N = 1024 * 1024 * 128;
#endif
namespace rp = rocprim;
template<
class Runner,
class T,
unsigned int BlockSize,
unsigned int ItemsPerThread,
unsigned int BinSize,
unsigned int Trials
>
__global__
__launch_bounds__(BlockSize)
void kernel(const T* input, T* output)
{
Runner::template run<T, BlockSize, ItemsPerThread, BinSize, Trials>(input, output);
}
template<rocprim::block_histogram_algorithm algorithm>
struct histogram
{
template<
class T,
unsigned int BlockSize,
unsigned int ItemsPerThread,
unsigned int BinSize,
unsigned int Trials
>
__device__
static void run(const T* input, T* output)
{
// TODO: Move global_offset into final loop
const unsigned int index = ((blockIdx.x * BlockSize) + threadIdx.x) * ItemsPerThread;
unsigned int global_offset = blockIdx.x * BinSize;
T values[ItemsPerThread];
for(unsigned int k = 0; k < ItemsPerThread; k++)
{
values[k] = input[index + k];
}
using bhistogram_t = rp::block_histogram<T, BlockSize, ItemsPerThread, BinSize, algorithm>;
__shared__ T histogram[BinSize];
__shared__ typename bhistogram_t::storage_type storage;
ROCPRIM_NO_UNROLL
for(unsigned int trial = 0; trial < Trials; trial++)
{
bhistogram_t().histogram(values, histogram, storage);
for(unsigned int k = 0; k < ItemsPerThread; k++)
{
values[k] = BinSize - 1 - values[k];
}
}
ROCPRIM_UNROLL
for (unsigned int offset = 0; offset < BinSize; offset += BlockSize)
{
if(offset + threadIdx.x < BinSize)
{
output[global_offset + threadIdx.x] = histogram[offset + threadIdx.x];
global_offset += BlockSize;
}
}
}
};
template<
class Benchmark,
class T,
unsigned int BlockSize,
unsigned int ItemsPerThread,
unsigned int BinSize = BlockSize,
unsigned int Trials = 100
>
void run_benchmark(benchmark::State& state, hipStream_t stream, size_t N)
{
// Make sure size is a multiple of BlockSize
constexpr auto items_per_block = BlockSize * ItemsPerThread;
const auto size = items_per_block * ((N + items_per_block - 1)/items_per_block);
const auto bin_size = BinSize * ((N + items_per_block - 1)/items_per_block);
// Allocate and fill memory
std::vector<T> input(size, 0.0f);
T * d_input;
T * d_output;
HIP_CHECK(hipMalloc(reinterpret_cast<void**>(&d_input), size * sizeof(T)));
HIP_CHECK(hipMalloc(reinterpret_cast<void**>(&d_output), bin_size * sizeof(T)));
HIP_CHECK(
hipMemcpy(
d_input, input.data(),
size * sizeof(T),
hipMemcpyHostToDevice
)
);
HIP_CHECK(hipDeviceSynchronize());
// HIP events creation
hipEvent_t start, stop;
HIP_CHECK(hipEventCreate(&start));
HIP_CHECK(hipEventCreate(&stop));
for (auto _ : state)
{
// Record start event
HIP_CHECK(hipEventRecord(start, stream));
hipLaunchKernelGGL(
HIP_KERNEL_NAME(kernel<Benchmark, T, BlockSize, ItemsPerThread, BinSize, Trials>),
dim3(size/items_per_block), dim3(BlockSize), 0, stream,
d_input, d_output
);
HIP_CHECK(hipGetLastError());
// Record stop event and wait until it completes
HIP_CHECK(hipEventRecord(stop, stream));
HIP_CHECK(hipEventSynchronize(stop));
float elapsed_mseconds;
HIP_CHECK(hipEventElapsedTime(&elapsed_mseconds, start, stop));
state.SetIterationTime(elapsed_mseconds / 1000);
}
// Destroy HIP events
HIP_CHECK(hipEventDestroy(start));
HIP_CHECK(hipEventDestroy(stop));
state.SetBytesProcessed(state.iterations() * size * sizeof(T) * Trials);
state.SetItemsProcessed(state.iterations() * size * Trials);
HIP_CHECK(hipFree(d_input));
HIP_CHECK(hipFree(d_output));
}
// IPT - items per thread
#define CREATE_BENCHMARK(T, BS, IPT) \
benchmark::RegisterBenchmark( \
bench_naming::format_name("{lvl:block,algo:histogram,key_type:" #T ",cfg:{bs:" #BS \
",ipt:" #IPT ",method:" \
+ method_name + "}}") \
.c_str(), \
run_benchmark<Benchmark, T, BS, IPT>, \
stream, \
size)
#define BENCHMARK_TYPE(type, block) \
CREATE_BENCHMARK(type, block, 1), \
CREATE_BENCHMARK(type, block, 2), \
CREATE_BENCHMARK(type, block, 3), \
CREATE_BENCHMARK(type, block, 4), \
CREATE_BENCHMARK(type, block, 8), \
CREATE_BENCHMARK(type, block, 16)
template<class Benchmark>
void add_benchmarks(std::vector<benchmark::internal::Benchmark*>& benchmarks,
const std::string& method_name,
hipStream_t stream,
size_t size)
{
std::vector<benchmark::internal::Benchmark*> new_benchmarks =
{
BENCHMARK_TYPE(int, 256),
BENCHMARK_TYPE(int, 320),
BENCHMARK_TYPE(int, 512),
BENCHMARK_TYPE(unsigned long long, 256),
BENCHMARK_TYPE(unsigned long long, 320)
};
benchmarks.insert(benchmarks.end(), new_benchmarks.begin(), new_benchmarks.end());
}
int main(int argc, char *argv[])
{
cli::Parser parser(argc, argv);
parser.set_optional<size_t>("size", "size", DEFAULT_N, "number of values");
parser.set_optional<int>("trials", "trials", -1, "number of iterations");
parser.set_optional<std::string>("name_format",
"name_format",
"human",
"either: json,human,txt");
parser.run_and_exit_if_error();
// Parse argv
benchmark::Initialize(&argc, argv);
const size_t size = parser.get<size_t>("size");
const int trials = parser.get<int>("trials");
bench_naming::set_format(parser.get<std::string>("name_format"));
// HIP
hipStream_t stream = 0; // default
// Benchmark info
add_common_benchmark_info();
benchmark::AddCustomContext("size", std::to_string(size));
// Add benchmarks
std::vector<benchmark::internal::Benchmark*> benchmarks;
// using_atomic
using histogram_a_t = histogram<rocprim::block_histogram_algorithm::using_atomic>;
add_benchmarks<histogram_a_t>(benchmarks, "using_atomic", stream, size);
// using_sort
using histogram_s_t = histogram<rocprim::block_histogram_algorithm::using_sort>;
add_benchmarks<histogram_s_t>(benchmarks, "using_sort", stream, size);
// Use manual timing
for(auto& b : benchmarks)
{
b->UseManualTime();
b->Unit(benchmark::kMillisecond);
}
// Force number of iterations
if(trials > 0)
{
for(auto& b : benchmarks)
{
b->Iterations(trials);
}
}
// Run benchmarks
benchmark::RunSpecifiedBenchmarks();
return 0;
}