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
95 lines
2.8 KiB
Plaintext
95 lines
2.8 KiB
Plaintext
/*
|
|
* Copyright 2021 NVIDIA Corporation
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <cub/config.cuh>
|
|
|
|
#if defined(_CCCL_IMPLICIT_SYSTEM_HEADER_GCC)
|
|
# pragma GCC system_header
|
|
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_CLANG)
|
|
# pragma clang system_header
|
|
#elif defined(_CCCL_IMPLICIT_SYSTEM_HEADER_MSVC)
|
|
# pragma system_header
|
|
#endif // no system header
|
|
|
|
#include <cub/util_namespace.cuh>
|
|
|
|
CUB_NAMESPACE_BEGIN
|
|
|
|
namespace detail
|
|
{
|
|
/**
|
|
* @brief It's a double-buffer storage wrapper for multi-pass stream
|
|
* transformations that require more than one storage array for
|
|
* streaming intermediate results back and forth.
|
|
*
|
|
* Many multi-pass computations require a pair of "ping-pong" storage buffers
|
|
* (e.g., one for reading from and the other for writing to, and then
|
|
* vice-versa for the subsequent pass). This structure wraps a set of device
|
|
* buffers.
|
|
*
|
|
* Unlike `cub::DoubleBuffer` this class doesn't provide a "selector" member
|
|
* to track which buffer is "current". The main reason for this class existence
|
|
* is the performance difference. Since `cub::DoubleBuffer` relies on the
|
|
* runtime variable to index pointers arrays, they are placed in the local
|
|
* memory instead of registers. Local memory accesses significantly affect
|
|
* performance. On the contrary, this class swaps pointer, so all operations
|
|
* can be performed in registers.
|
|
*/
|
|
template <typename T>
|
|
class device_double_buffer
|
|
{
|
|
/// Pair of device buffer pointers
|
|
T* m_current_buffer{};
|
|
T* m_alternate_buffer{};
|
|
|
|
public:
|
|
/**
|
|
* @param d_current
|
|
* The currently valid buffer
|
|
*
|
|
* @param d_alternate
|
|
* Alternate storage buffer of the same size as @p d_current
|
|
*/
|
|
_CCCL_HOST_DEVICE _CCCL_FORCEINLINE device_double_buffer(T* current, T* alternate)
|
|
: m_current_buffer(current)
|
|
, m_alternate_buffer(alternate)
|
|
{}
|
|
|
|
/// \brief Return pointer to the currently valid buffer
|
|
_CCCL_HOST_DEVICE _CCCL_FORCEINLINE T* current() const
|
|
{
|
|
return m_current_buffer;
|
|
}
|
|
|
|
/// \brief Return pointer to the currently invalid buffer
|
|
_CCCL_HOST_DEVICE _CCCL_FORCEINLINE T* alternate() const
|
|
{
|
|
return m_alternate_buffer;
|
|
}
|
|
|
|
_CCCL_HOST_DEVICE void swap()
|
|
{
|
|
T* tmp = m_current_buffer;
|
|
m_current_buffer = m_alternate_buffer;
|
|
m_alternate_buffer = tmp;
|
|
}
|
|
};
|
|
} // namespace detail
|
|
|
|
CUB_NAMESPACE_END
|