56fd68e7dd
CCCL (CUDA C++ Core Libraries) provides: - CUB: device/block/warp-level GPU primitives (reduce, scan, sort, topk) - Thrust: high-level parallel algorithms (transform_reduce, sort, scan) - libcudacxx: CUDA C++ standard library (atomics, barriers, memory) - cudax: experimental features (memory resources, allocators) - Tuning policies: per-SM hardware-specific algorithm parameters Competition optimization vectors mapped to CCCL: - Output TPS (83% weight): warp_reduce, block_reduce, device_topk - Input TPS (14% weight): device_scan, block_load, prefetch - Cache TPS (3% weight): prefix caching strategy patterns - Memory (0.9 util): pooled/cached/buddy allocators Source: https://github.com/NVIDIA/cccl (shallow clone, HEAD only) License: Apache-2.0
76 lines
2.5 KiB
Plaintext
76 lines
2.5 KiB
Plaintext
#include <thrust/functional.h>
|
|
#include <thrust/merge.h>
|
|
#include <thrust/sort.h>
|
|
#include <thrust/unique.h>
|
|
|
|
#include <unittest/unittest.h>
|
|
|
|
template <typename T, typename CompareOp, typename... Args>
|
|
auto call_merge(Args&&... args) -> decltype(thrust::merge(std::forward<Args>(args)...))
|
|
{
|
|
if constexpr (::cuda::std::is_void<CompareOp>::value)
|
|
{
|
|
return thrust::merge(std::forward<Args>(args)...);
|
|
}
|
|
else
|
|
{
|
|
// TODO(bgruber): remove next line in C++17 and pass CompareOp{} directly to stable_sort
|
|
using C = ::cuda::std::conditional_t<::cuda::std::is_void<CompareOp>::value, ::cuda::std::less<T>, CompareOp>;
|
|
return thrust::merge(std::forward<Args>(args)..., C{});
|
|
}
|
|
_CCCL_UNREACHABLE();
|
|
}
|
|
|
|
template <typename U, typename CompareOp = void>
|
|
void TestMergeKeyValue(size_t n)
|
|
{
|
|
using T = key_value<U, U>;
|
|
|
|
const auto h_keys_a = unittest::random_integers<U>(n);
|
|
const auto h_values_a = unittest::random_integers<U>(n);
|
|
|
|
const auto h_keys_b = unittest::random_integers<U>(n);
|
|
const auto h_values_b = unittest::random_integers<U>(n);
|
|
|
|
thrust::host_vector<T> h_a(n), h_b(n);
|
|
for (size_t i = 0; i < n; ++i)
|
|
{
|
|
h_a[i] = T(h_keys_a[i], h_values_a[i]);
|
|
h_b[i] = T(h_keys_b[i], h_values_b[i]);
|
|
}
|
|
|
|
if constexpr (::cuda::std::is_void<CompareOp>::value)
|
|
{
|
|
thrust::stable_sort(h_a.begin(), h_a.end());
|
|
thrust::stable_sort(h_b.begin(), h_b.end());
|
|
}
|
|
else
|
|
{
|
|
// TODO(bgruber): remove next line in C++17 and pass CompareOp{} directly to stable_sort
|
|
using C = ::cuda::std::conditional_t<::cuda::std::is_void<CompareOp>::value, ::cuda::std::less<T>, CompareOp>;
|
|
thrust::stable_sort(h_a.begin(), h_a.end(), C{});
|
|
thrust::stable_sort(h_b.begin(), h_b.end(), C{});
|
|
}
|
|
|
|
const thrust::device_vector<T> d_a = h_a;
|
|
const thrust::device_vector<T> d_b = h_b;
|
|
|
|
thrust::host_vector<T> h_result(h_a.size() + h_b.size());
|
|
thrust::device_vector<T> d_result(d_a.size() + d_b.size());
|
|
|
|
const auto h_end = call_merge<T, CompareOp>(h_a.begin(), h_a.end(), h_b.begin(), h_b.end(), h_result.begin());
|
|
const auto d_end = call_merge<T, CompareOp>(d_a.begin(), d_a.end(), d_b.begin(), d_b.end(), d_result.begin());
|
|
|
|
ASSERT_EQUAL_QUIET(h_result, d_result);
|
|
ASSERT_EQUAL(true, h_end == h_result.end());
|
|
ASSERT_EQUAL(true, d_end == d_result.end());
|
|
}
|
|
DECLARE_VARIABLE_UNITTEST(TestMergeKeyValue);
|
|
|
|
template <typename U>
|
|
void TestMergeKeyValueDescending(size_t n)
|
|
{
|
|
TestMergeKeyValue<U, ::cuda::std::greater<key_value<U, U>>>(n);
|
|
}
|
|
DECLARE_VARIABLE_UNITTEST(TestMergeKeyValueDescending);
|