Skip to content

Re-write qsort benchmarks #35

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
May 2, 2023
Merged

Re-write qsort benchmarks #35

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 22 additions & 0 deletions benchmarks/bench-qsort-common.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,4 +8,26 @@
#include "avx512-32bit-qsort.hpp"
#include "avx512-64bit-qsort.hpp"

#define MY_BENCHMARK_CAPTURE(func, T, test_case_name, ...) \
BENCHMARK_PRIVATE_DECLARE(func) \
= (::benchmark::internal::RegisterBenchmarkInternal( \
new ::benchmark::internal::FunctionBenchmark( \
#func "/" #test_case_name "/" #T, \
[](::benchmark::State &st) { \
func<T>(st, __VA_ARGS__); \
})))

#define BENCH(func, type) \
MY_BENCHMARK_CAPTURE( \
func, type, random_10000, 10000, std::string("random")); \
MY_BENCHMARK_CAPTURE( \
func, type, random_100000, 100000, std::string("random")); \
MY_BENCHMARK_CAPTURE( \
func, type, sorted_10000, 10000, std::string("sorted")); \
MY_BENCHMARK_CAPTURE( \
func, type, constant_10000, 10000, std::string("constant")); \
MY_BENCHMARK_CAPTURE( \
func, type, reverse_10000, 10000, std::string("reverse"));


#endif
102 changes: 64 additions & 38 deletions benchmarks/bench_qsort.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,68 +1,94 @@
#include "bench-qsort-common.h"

template <typename T>
static void avx512_qsort(benchmark::State& state) {
if (!cpu_has_avx512bw()) {
state.SkipWithMessage("Requires AVX512 BW ISA");
}
if ((sizeof(T) == 2) && (!cpu_has_avx512_vbmi2())) {
state.SkipWithMessage("Requires AVX512 VBMI2 ISA");
}
template <typename T, class... Args>
static void stdsort(benchmark::State &state, Args &&...args)
{
auto args_tuple = std::make_tuple(std::move(args)...);
// Perform setup here
size_t ARRSIZE = state.range(0);
size_t ARRSIZE = std::get<0>(args_tuple);
std::vector<T> arr;
std::vector<T> arr_bkp;

/* Initialize elements */
arr = get_uniform_rand_array<T>(ARRSIZE);
std::string arrtype = std::get<1>(args_tuple);
if (arrtype == "random") { arr = get_uniform_rand_array<T>(ARRSIZE); }
else if (arrtype == "sorted") {
arr = get_uniform_rand_array<T>(ARRSIZE);
std::sort(arr.begin(), arr.end());
}
else if (arrtype == "constant") {
T temp = get_uniform_rand_array<T>(1)[0];
for (size_t ii = 0; ii < ARRSIZE; ++ii) {
arr.push_back(temp);
}
}
else if (arrtype == "reverse") {
arr = get_uniform_rand_array<T>(ARRSIZE);
std::sort(arr.begin(), arr.end());
std::reverse(arr.begin(), arr.end());
}
arr_bkp = arr;

/* call avx512 quicksort */
for (auto _ : state) {
avx512_qsort<T>(arr.data(), ARRSIZE);
std::sort(arr.begin(), arr.end());
state.PauseTiming();
arr = arr_bkp;
state.ResumeTiming();
}
}

template <typename T>
static void stdsort(benchmark::State& state) {
template <typename T, class... Args>
static void avx512qsort(benchmark::State &state, Args &&...args)
{
auto args_tuple = std::make_tuple(std::move(args)...);
if (!cpu_has_avx512bw()) {
state.SkipWithMessage("Requires AVX512 BW ISA");
}
if ((sizeof(T) == 2) && (!cpu_has_avx512_vbmi2())) {
state.SkipWithMessage("Requires AVX512 VBMI2");
}
// Perform setup here
size_t ARRSIZE = state.range(0);
size_t ARRSIZE = std::get<0>(args_tuple);
std::vector<T> arr;
std::vector<T> arr_bkp;

/* Initialize elements */
arr = get_uniform_rand_array<T>(ARRSIZE);
std::string arrtype = std::get<1>(args_tuple);
if (arrtype == "random") { arr = get_uniform_rand_array<T>(ARRSIZE); }
else if (arrtype == "sorted") {
arr = get_uniform_rand_array<T>(ARRSIZE);
std::sort(arr.begin(), arr.end());
}
else if (arrtype == "constant") {
T temp = get_uniform_rand_array<T>(1)[0];
for (size_t ii = 0; ii < ARRSIZE; ++ii) {
arr.push_back(temp);
}
}
else if (arrtype == "reverse") {
arr = get_uniform_rand_array<T>(ARRSIZE);
std::sort(arr.begin(), arr.end());
std::reverse(arr.begin(), arr.end());
}
arr_bkp = arr;

/* call std::sort */
/* call avx512 quicksort */
for (auto _ : state) {
std::sort(arr.begin(), arr.end());
avx512_qsort<T>(arr.data(), ARRSIZE);
state.PauseTiming();
arr = arr_bkp;
state.ResumeTiming();
}
}

// Register the function as a benchmark
BENCHMARK(avx512_qsort<float>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<float>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<uint32_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<uint32_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<int32_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<int32_t>)->Arg(10000)->Arg(1000000);

BENCHMARK(avx512_qsort<double>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<double>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<uint64_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<uint64_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<int64_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<int64_t>)->Arg(10000)->Arg(1000000);
#define BENCH_ALL(type)\
BENCH(avx512qsort, type)\
BENCH(stdsort, type)

//BENCHMARK(avx512_qsort<float16>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<uint16_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<uint16_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(avx512_qsort<int16_t>)->Arg(10000)->Arg(1000000);
BENCHMARK(stdsort<int16_t>)->Arg(10000)->Arg(1000000);
BENCH_ALL(uint64_t)
BENCH_ALL(int64_t)
BENCH_ALL(uint32_t)
BENCH_ALL(int32_t)
BENCH_ALL(uint16_t)
BENCH_ALL(int16_t)
BENCH_ALL(float)
BENCH_ALL(double)