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
|
// MIT License
//
// Copyright (c) 2023-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.
#ifndef ROCPRIM_BENCHMARK_BINARY_SEARCH_PARALLEL_HPP_
#define ROCPRIM_BENCHMARK_BINARY_SEARCH_PARALLEL_HPP_
#include "benchmark_utils.hpp"
#include <rocprim/device/config_types.hpp>
#include <rocprim/device/device_binary_search.hpp>
#include <benchmark/benchmark.h>
#include <hip/hip_runtime_api.h>
#include <string>
#include <vector>
#include <cstddef>
struct binary_search_subalgorithm
{
std::string name() const
{
return "binary_search";
}
};
struct lower_bound_subalgorithm
{
std::string name() const
{
return "lower_bound";
}
};
struct upper_bound_subalgorithm
{
std::string name() const
{
return "upper_bound";
}
};
template<class Config = rocprim::default_config>
struct dispatch_binary_search_helper
{
template<class... Args>
hipError_t dispatch_binary_search(binary_search_subalgorithm, Args&&... args)
{
using config = rocprim::binary_search_config<Config::block_size, Config::items_per_thread>;
return rocprim::binary_search<config>(std::forward<Args>(args)...);
}
template<class... Args>
hipError_t dispatch_binary_search(upper_bound_subalgorithm, Args&&... args)
{
using config = rocprim::upper_bound_config<Config::block_size, Config::items_per_thread>;
return rocprim::upper_bound<config>(std::forward<Args>(args)...);
}
template<class... Args>
hipError_t dispatch_binary_search(lower_bound_subalgorithm, Args&&... args)
{
using config = rocprim::lower_bound_config<Config::block_size, Config::items_per_thread>;
return rocprim::lower_bound<config>(std::forward<Args>(args)...);
}
};
template<>
struct dispatch_binary_search_helper<rocprim::default_config>
{
template<class... Args>
hipError_t dispatch_binary_search(binary_search_subalgorithm, Args&&... args)
{
return rocprim::binary_search<rocprim::default_config>(std::forward<Args>(args)...);
}
template<class... Args>
hipError_t dispatch_binary_search(upper_bound_subalgorithm, Args&&... args)
{
return rocprim::upper_bound<rocprim::default_config>(std::forward<Args>(args)...);
}
template<class... Args>
hipError_t dispatch_binary_search(lower_bound_subalgorithm, Args&&... args)
{
return rocprim::lower_bound<rocprim::default_config>(std::forward<Args>(args)...);
}
};
template<class SubAlgorithm, class T, class OutputType, class Config>
struct device_binary_search_benchmark : public config_autotune_interface
{
std::string name() const override
{
return bench_naming::format_name("{lvl:device,algo:" + SubAlgorithm{}.name()
+ ",value_type:" + std::string(Traits<T>::name())
+ ",output_type:" + std::string(Traits<OutputType>::name())
+ ",cfg:{bs:" + std::to_string(Config::block_size)
+ ",ipt:" + std::to_string(Config::items_per_thread)
+ "}}");
}
void run(benchmark::State& state,
size_t haystack_size,
const managed_seed& seed,
hipStream_t stream) const override
{
using compare_op_t = rocprim::less<T>;
const auto needles_size = haystack_size / 10;
compare_op_t compare_op;
std::vector<T> haystack(haystack_size);
std::iota(haystack.begin(), haystack.end(), 0);
const auto random_range = limit_random_range<T>(0, haystack_size);
std::vector<T> needles = get_random_data<T>(needles_size,
random_range.first,
random_range.second,
seed.get_0());
T* d_haystack;
T* d_needles;
OutputType* d_output;
HIP_CHECK(hipMalloc(&d_haystack, haystack_size * sizeof(*d_haystack)));
HIP_CHECK(hipMalloc(&d_needles, needles_size * sizeof(*d_needles)));
HIP_CHECK(hipMalloc(&d_output, needles_size * sizeof(*d_output)));
HIP_CHECK(hipMemcpy(d_haystack,
haystack.data(),
haystack_size * sizeof(*d_haystack),
hipMemcpyHostToDevice));
HIP_CHECK(hipMemcpy(d_needles,
needles.data(),
needles_size * sizeof(*d_needles),
hipMemcpyHostToDevice));
void* d_temporary_storage = nullptr;
size_t temporary_storage_bytes;
auto dispatch_helper = dispatch_binary_search_helper<Config>();
HIP_CHECK(dispatch_helper.dispatch_binary_search(SubAlgorithm{},
d_temporary_storage,
temporary_storage_bytes,
d_haystack,
d_needles,
d_output,
haystack_size,
needles_size,
compare_op,
stream));
HIP_CHECK(hipMalloc(&d_temporary_storage, temporary_storage_bytes));
// Warm-up
HIP_CHECK(dispatch_helper.dispatch_binary_search(SubAlgorithm{},
d_temporary_storage,
temporary_storage_bytes,
d_haystack,
d_needles,
d_output,
haystack_size,
needles_size,
compare_op,
stream));
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));
HIP_CHECK(dispatch_helper.dispatch_binary_search(SubAlgorithm{},
d_temporary_storage,
temporary_storage_bytes,
d_haystack,
d_needles,
d_output,
haystack_size,
needles_size,
compare_op,
stream));
// 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() * needles_size * sizeof(T));
state.SetItemsProcessed(state.iterations() * needles_size);
HIP_CHECK(hipFree(d_temporary_storage));
HIP_CHECK(hipFree(d_haystack));
HIP_CHECK(hipFree(d_needles));
HIP_CHECK(hipFree(d_output));
}
};
#endif // ROCPRIM_BENCHMARK_BINARY_SEARCH_PARALLEL_HPP_
|
