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
146 lines
4.7 KiB
Plaintext
146 lines
4.7 KiB
Plaintext
#include <thrust/extrema.h>
|
|
#include <thrust/functional.h>
|
|
#include <thrust/iterator/discard_iterator.h>
|
|
#include <thrust/iterator/retag.h>
|
|
#include <thrust/merge.h>
|
|
#include <thrust/sort.h>
|
|
#include <thrust/unique.h>
|
|
|
|
#include <unittest/unittest.h>
|
|
|
|
template <typename Vector>
|
|
void TestMergeSimple()
|
|
{
|
|
const Vector a{0, 2, 4}, b{0, 3, 3, 4};
|
|
const Vector ref{0, 0, 2, 3, 3, 4, 4};
|
|
|
|
Vector result(7);
|
|
const auto end = thrust::merge(a.begin(), a.end(), b.begin(), b.end(), result.begin());
|
|
|
|
ASSERT_EQUAL_QUIET(result.end(), end);
|
|
ASSERT_EQUAL(ref, result);
|
|
}
|
|
DECLARE_VECTOR_UNITTEST(TestMergeSimple);
|
|
|
|
template <typename InputIterator1, typename InputIterator2, typename OutputIterator>
|
|
OutputIterator
|
|
merge(my_system& system, InputIterator1, InputIterator1, InputIterator2, InputIterator2, OutputIterator result)
|
|
{
|
|
system.validate_dispatch();
|
|
return result;
|
|
}
|
|
|
|
void TestMergeDispatchExplicit()
|
|
{
|
|
thrust::device_vector<int> vec(1);
|
|
|
|
my_system sys(0);
|
|
thrust::merge(sys, vec.begin(), vec.begin(), vec.begin(), vec.begin(), vec.begin());
|
|
|
|
ASSERT_EQUAL(true, sys.is_valid());
|
|
}
|
|
DECLARE_UNITTEST(TestMergeDispatchExplicit);
|
|
|
|
template <typename InputIterator1, typename InputIterator2, typename OutputIterator>
|
|
OutputIterator merge(my_tag, InputIterator1, InputIterator1, InputIterator2, InputIterator2, OutputIterator result)
|
|
{
|
|
*result = 13;
|
|
return result;
|
|
}
|
|
|
|
void TestMergeDispatchImplicit()
|
|
{
|
|
thrust::device_vector<int> vec(1);
|
|
|
|
thrust::merge(thrust::retag<my_tag>(vec.begin()),
|
|
thrust::retag<my_tag>(vec.begin()),
|
|
thrust::retag<my_tag>(vec.begin()),
|
|
thrust::retag<my_tag>(vec.begin()),
|
|
thrust::retag<my_tag>(vec.begin()));
|
|
|
|
ASSERT_EQUAL(13, vec.front());
|
|
}
|
|
DECLARE_UNITTEST(TestMergeDispatchImplicit);
|
|
|
|
template <typename T>
|
|
void TestMerge(size_t n)
|
|
{
|
|
const size_t sizes[] = {0, 1, n / 2, n, n + 1, 2 * n};
|
|
const size_t num_sizes = sizeof(sizes) / sizeof(size_t);
|
|
|
|
const thrust::host_vector<T> random =
|
|
unittest::random_integers<unittest::int8_t>(n + *thrust::max_element(sizes, sizes + num_sizes));
|
|
|
|
thrust::host_vector<T> h_a(random.begin(), random.begin() + n);
|
|
thrust::host_vector<T> h_b(random.begin() + n, random.end());
|
|
|
|
thrust::stable_sort(h_a.begin(), h_a.end());
|
|
thrust::stable_sort(h_b.begin(), h_b.end());
|
|
|
|
const thrust::device_vector<T> d_a = h_a;
|
|
const thrust::device_vector<T> d_b = h_b;
|
|
|
|
for (const auto size : sizes)
|
|
{
|
|
thrust::host_vector<T> h_result(n + size);
|
|
thrust::device_vector<T> d_result(n + size);
|
|
|
|
const auto h_end = thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.begin() + size, h_result.begin());
|
|
const auto d_end = thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.begin() + size, d_result.begin());
|
|
|
|
h_result.resize(h_end - h_result.begin());
|
|
d_result.resize(d_end - d_result.begin());
|
|
|
|
ASSERT_EQUAL(h_result, d_result);
|
|
}
|
|
}
|
|
DECLARE_VARIABLE_UNITTEST(TestMerge);
|
|
|
|
template <typename T>
|
|
void TestMergeToDiscardIterator(size_t n)
|
|
{
|
|
thrust::host_vector<T> h_a = unittest::random_integers<T>(n);
|
|
thrust::host_vector<T> h_b = unittest::random_integers<T>(n);
|
|
|
|
thrust::stable_sort(h_a.begin(), h_a.end());
|
|
thrust::stable_sort(h_b.begin(), h_b.end());
|
|
|
|
const thrust::device_vector<T> d_a = h_a;
|
|
const thrust::device_vector<T> d_b = h_b;
|
|
|
|
const auto h_result = thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.end(), thrust::make_discard_iterator());
|
|
const auto d_result = thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.end(), thrust::make_discard_iterator());
|
|
|
|
thrust::discard_iterator<> reference(static_cast<std::ptrdiff_t>(2 * n));
|
|
|
|
ASSERT_EQUAL_QUIET(reference, h_result);
|
|
ASSERT_EQUAL_QUIET(reference, d_result);
|
|
}
|
|
DECLARE_VARIABLE_UNITTEST(TestMergeToDiscardIterator);
|
|
|
|
template <typename T>
|
|
void TestMergeDescending(size_t n)
|
|
{
|
|
thrust::host_vector<T> h_a = unittest::random_integers<T>(n);
|
|
thrust::host_vector<T> h_b = unittest::random_integers<T>(n);
|
|
|
|
thrust::stable_sort(h_a.begin(), h_a.end(), ::cuda::std::greater<T>());
|
|
thrust::stable_sort(h_b.begin(), h_b.end(), ::cuda::std::greater<T>());
|
|
|
|
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 =
|
|
thrust::merge(h_a.begin(), h_a.end(), h_b.begin(), h_b.end(), h_result.begin(), ::cuda::std::greater<T>());
|
|
const auto d_end =
|
|
thrust::merge(d_a.begin(), d_a.end(), d_b.begin(), d_b.end(), d_result.begin(), ::cuda::std::greater<T>());
|
|
|
|
ASSERT_EQUAL(h_result, d_result);
|
|
ASSERT_EQUAL(h_end == h_result.end(), true);
|
|
ASSERT_EQUAL(d_end == d_result.end(), true);
|
|
}
|
|
DECLARE_VARIABLE_UNITTEST(TestMergeDescending);
|