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
|
// MIT License
//
// Copyright (c) 2021-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"
#include "cmdparser.hpp"
#include <benchmark/benchmark.h>
#include <rocprim/block/block_load_func.hpp>
#include <rocprim/block/block_run_length_decode.hpp>
#include <rocprim/block/block_store_func.hpp>
#include <random>
#include <vector>
#ifndef DEFAULT_N
const size_t DEFAULT_BYTES = 1024 * 1024 * 32 * 4;
#endif
template<class ItemT,
class OffsetT,
unsigned BlockSize,
unsigned RunsPerThread,
unsigned DecodedItemsPerThread,
unsigned Trials>
__global__
__launch_bounds__(BlockSize) void block_run_length_decode_kernel(const ItemT* d_run_items,
const OffsetT* d_run_offsets,
ItemT* d_decoded_items,
bool enable_store = false)
{
using BlockRunLengthDecodeT
= rocprim::block_run_length_decode<ItemT, BlockSize, RunsPerThread, DecodedItemsPerThread>;
ItemT run_items[RunsPerThread];
OffsetT run_offsets[RunsPerThread];
const unsigned global_thread_idx = BlockSize * hipBlockIdx_x + hipThreadIdx_x;
rocprim::block_load_direct_blocked(global_thread_idx, d_run_items, run_items);
rocprim::block_load_direct_blocked(global_thread_idx, d_run_offsets, run_offsets);
BlockRunLengthDecodeT block_run_length_decode(run_items, run_offsets);
const OffsetT total_decoded_size
= d_run_offsets[(hipBlockIdx_x + 1) * BlockSize * RunsPerThread]
- d_run_offsets[hipBlockIdx_x * BlockSize * RunsPerThread];
#pragma nounroll
for(unsigned i = 0; i < Trials; ++i)
{
OffsetT decoded_window_offset = 0;
while(decoded_window_offset < total_decoded_size)
{
ItemT decoded_items[DecodedItemsPerThread];
block_run_length_decode.run_length_decode(decoded_items, decoded_window_offset);
if(enable_store)
{
rocprim::block_store_direct_blocked(global_thread_idx,
d_decoded_items + decoded_window_offset,
decoded_items);
}
decoded_window_offset += BlockSize * DecodedItemsPerThread;
}
}
}
template<class ItemT,
class OffsetT,
unsigned MinRunLength,
unsigned MaxRunLength,
unsigned BlockSize,
unsigned RunsPerThread,
unsigned DecodedItemsPerThread,
unsigned Trials = 100>
void run_benchmark(benchmark::State& state, size_t bytes, const managed_seed& seed, hipStream_t stream)
{
// Calculate the number of elements N
size_t N = bytes / sizeof(ItemT);
constexpr auto runs_per_block = BlockSize * RunsPerThread;
const auto target_num_runs = 2 * N / (MinRunLength + MaxRunLength);
const auto num_runs
= runs_per_block * ((target_num_runs + runs_per_block - 1) / runs_per_block);
std::vector<ItemT> run_items(num_runs);
std::vector<OffsetT> run_offsets(num_runs + 1);
engine_type prng(seed.get_0());
using ItemDistribution = std::conditional_t<std::is_integral<ItemT>::value,
std::uniform_int_distribution<ItemT>,
std::uniform_real_distribution<ItemT>>;
ItemDistribution run_item_dist(0, 100);
std::uniform_int_distribution<OffsetT> run_length_dist(MinRunLength, MaxRunLength);
for(size_t i = 0; i < num_runs; ++i)
{
run_items[i] = run_item_dist(prng);
}
for(size_t i = 1; i < num_runs + 1; ++i)
{
const OffsetT next_run_length = run_length_dist(prng);
run_offsets[i] = run_offsets[i - 1] + next_run_length;
}
const OffsetT output_length = run_offsets.back();
ItemT* d_run_items{};
HIP_CHECK(hipMalloc(&d_run_items, run_items.size() * sizeof(ItemT)));
HIP_CHECK(hipMemcpy(d_run_items,
run_items.data(),
run_items.size() * sizeof(ItemT),
hipMemcpyHostToDevice));
OffsetT* d_run_offsets{};
HIP_CHECK(hipMalloc(&d_run_offsets, run_offsets.size() * sizeof(OffsetT)));
HIP_CHECK(hipMemcpy(d_run_offsets,
run_offsets.data(),
run_offsets.size() * sizeof(OffsetT),
hipMemcpyHostToDevice));
ItemT* d_output{};
HIP_CHECK(hipMalloc(&d_output, output_length * sizeof(ItemT)));
for(auto _ : state)
{
auto start = std::chrono::steady_clock::now();
hipLaunchKernelGGL(HIP_KERNEL_NAME(block_run_length_decode_kernel<ItemT,
OffsetT,
BlockSize,
RunsPerThread,
DecodedItemsPerThread,
Trials>),
dim3(num_runs / runs_per_block),
dim3(BlockSize),
0,
stream,
d_run_items,
d_run_offsets,
d_output);
HIP_CHECK(hipPeekAtLastError());
HIP_CHECK(hipDeviceSynchronize());
auto end = std::chrono::steady_clock::now();
auto elapsed_seconds
= std::chrono::duration_cast<std::chrono::duration<double>>(end - start);
state.SetIterationTime(elapsed_seconds.count());
}
state.SetBytesProcessed(state.iterations() * output_length * sizeof(ItemT) * Trials);
state.SetItemsProcessed(state.iterations() * output_length * Trials);
HIP_CHECK(hipFree(d_run_items));
HIP_CHECK(hipFree(d_run_offsets));
HIP_CHECK(hipFree(d_output));
}
#define CREATE_BENCHMARK(IT, OT, MINRL, MAXRL, BS, RPT, DIPT) \
benchmark::RegisterBenchmark( \
bench_naming::format_name("{lvl:block,algo:run_length_decode" \
",item_type:" #IT ",offset_type:" #OT ",min_run_length:" #MINRL \
",max_run_length:" #MAXRL ",cfg:{block_size:" #BS \
",run_per_thread:" #RPT ",decoded_items_per_thread:" #DIPT "}}") \
.c_str(), \
&run_benchmark<IT, OT, MINRL, MAXRL, BS, RPT, DIPT>, \
bytes, \
seed, \
stream)
int main(int argc, char* argv[])
{
cli::Parser parser(argc, argv);
parser.set_optional<size_t>("size", "size", DEFAULT_BYTES, "number of bytes");
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.set_optional<std::string>("seed", "seed", "random", get_seed_message());
parser.run_and_exit_if_error();
// Parse argv
benchmark::Initialize(&argc, argv);
const size_t bytes = parser.get<size_t>("size");
const int trials = parser.get<int>("trials");
bench_naming::set_format(parser.get<std::string>("name_format"));
const std::string seed_type = parser.get<std::string>("seed");
const managed_seed seed(seed_type);
// HIP
hipStream_t stream = 0; // default
// Benchmark info
add_common_benchmark_info();
benchmark::AddCustomContext("bytes", std::to_string(bytes));
benchmark::AddCustomContext("seed", seed_type);
// Add benchmarks
std::vector<benchmark::internal::Benchmark*> benchmarks{
CREATE_BENCHMARK(int, int, 1, 5, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 10, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 50, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 100, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 500, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 1000, 128, 2, 4),
CREATE_BENCHMARK(int, int, 1, 5000, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 5, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 10, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 50, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 100, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 500, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 1000, 128, 2, 4),
CREATE_BENCHMARK(double, long long, 1, 5000, 128, 2, 4)};
// 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;
}
|