Files
project_6/cccl_upstream/cub/cub/grid/grid_even_share.cuh
EngineX CI 56fd68e7dd [INFRA] Import NVIDIA/CCCL upstream as optimization reference library
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
2026-07-30 09:35:51 +00:00

198 lines
6.7 KiB
Plaintext

// SPDX-FileCopyrightText: Copyright (c) 2011, Duane Merrill. All rights reserved.
// SPDX-FileCopyrightText: Copyright (c) 2011-2018, NVIDIA CORPORATION. All rights reserved.
// SPDX-License-Identifier: BSD-3
/**
* @file
* cub::GridEvenShare is a descriptor utility for distributing input among CUDA thread blocks in an
* "even-share" fashion. Each thread block gets roughly the same number of fixed-size work units
* (grains).
*/
#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/grid/grid_mapping.cuh>
#include <cub/util_math.cuh>
#include <cub/util_type.cuh>
#include <cuda/__cmath/ceil_div.h>
#include <cuda/std/__algorithm/min.h>
#include <cuda/std/limits>
CUB_NAMESPACE_BEGIN
/**
* @brief GridEvenShare is a descriptor utility for distributing input among
* CUDA thread blocks in an "even-share" fashion. Each thread block gets roughly
* the same number of input tiles.
*
* @par Overview
* Each thread block is assigned a consecutive sequence of input tiles. To help
* preserve alignment and eliminate the overhead of guarded loads for all but the
* last thread block, to GridEvenShare assigns one of three different amounts of
* work to a given thread block: "big", "normal", or "last". The "big" workloads
* are one scheduling grain larger than "normal". The "last" work unit for the
* last thread block may be partially-full if the input is not an even multiple of
* the scheduling grain size.
*
* @par
* Before invoking a child grid, a parent thread will typically construct an
* instance of GridEvenShare. The instance can be passed to child thread blocks
* which can initialize their per-thread block offsets using \p BlockInit().
*
* @rst
* .. versionadded:: 2.2.0
* First appears in CUDA Toolkit 12.3.
* @endrst
*/
template <typename OffsetT>
struct GridEvenShare
{
private:
int total_tiles{0};
int big_shares{0};
OffsetT big_share_items{0};
OffsetT normal_share_items{0};
OffsetT normal_base_offset{0};
public:
/// Total number of input items
OffsetT num_items{0};
/// Grid size in thread blocks
int grid_size{0};
/// OffsetT into input marking the beginning of the owning thread block's segment of input tiles
OffsetT block_offset{0};
/// OffsetT into input of marking the end (one-past) of the owning thread block's segment of input tiles
OffsetT block_end{0};
/// Stride between input tiles
OffsetT block_stride{0};
/**
* \brief Constructor.
*/
_CCCL_FORCEINLINE GridEvenShare() = default;
/**
* @brief Dispatch initializer. To be called prior to kernel launch.
*
* @param num_items_
* Total number of input items
*
* @param max_grid_size
* Maximum grid size allowable (actual grid size may be less if not warranted by the the
* number of input items)
*
* @param tile_items
* Number of data items per input tile
*/
_CCCL_HOST_DEVICE _CCCL_FORCEINLINE void DispatchInit(OffsetT num_items_, int max_grid_size, int tile_items)
{
if (num_items_ <= 0 || max_grid_size <= 0 || tile_items <= 0)
{
this->num_items = 0;
this->grid_size = 0;
this->block_offset = 0;
this->block_end = 0;
return;
}
this->block_offset = num_items_; // Initialize past-the-end
this->block_end = num_items_; // Initialize past-the-end
this->num_items = num_items_;
this->total_tiles = static_cast<int>(
::cuda::std::min(OffsetT{::cuda::std::numeric_limits<int>::max()}, ::cuda::ceil_div(num_items_, tile_items)));
this->grid_size = ::cuda::std::min(total_tiles, max_grid_size);
int avg_tiles_per_block = total_tiles / grid_size;
// leftover grains go to big blocks:
this->big_shares = total_tiles - (avg_tiles_per_block * grid_size);
this->normal_share_items = static_cast<OffsetT>(avg_tiles_per_block) * tile_items;
this->normal_base_offset = static_cast<OffsetT>(big_shares) * tile_items;
this->big_share_items = normal_share_items + tile_items;
}
/**
* @brief Initializes ranges for the specified thread block index. Specialized
* for a "raking" access pattern in which each thread block is assigned a
* consecutive sequence of input tiles.
*/
template <int TILE_ITEMS>
_CCCL_DEVICE _CCCL_FORCEINLINE void BlockInit(int block_id, detail::constant_t<GRID_MAPPING_RAKE> /*strategy_tag*/)
{
block_stride = TILE_ITEMS;
if (block_id < big_shares)
{
// This thread block gets a big share of grains (avg_tiles_per_block + 1)
block_offset = (block_id * big_share_items);
block_end = block_offset + big_share_items;
}
else if (block_id < total_tiles)
{
// This thread block gets a normal share of grains (avg_tiles_per_block)
block_offset = normal_base_offset + (block_id * normal_share_items);
// Avoid generating values greater than num_items, as it may cause overflow
block_end = block_offset + ::cuda::std::min(num_items - block_offset, normal_share_items);
}
// Else default past-the-end
}
/**
* @brief Block-initialization, specialized for a "raking" access
* pattern in which each thread block is assigned a consecutive sequence
* of input tiles.
*/
template <int TILE_ITEMS>
_CCCL_DEVICE _CCCL_FORCEINLINE void
BlockInit(int block_id, detail::constant_t<GRID_MAPPING_STRIP_MINE> /*strategy_tag*/)
{
block_stride = grid_size * OffsetT{TILE_ITEMS};
block_offset = block_id * OffsetT{TILE_ITEMS};
block_end = num_items;
}
/**
* @brief Block-initialization, specialized for "strip mining" access
* pattern in which the input tiles assigned to each thread block are
* separated by a stride equal to the the extent of the grid.
*/
template <int TILE_ITEMS, GridMappingStrategy STRATEGY>
_CCCL_DEVICE _CCCL_FORCEINLINE void BlockInit()
{
BlockInit<TILE_ITEMS>(blockIdx.x, detail::constant_v<STRATEGY>);
}
/**
* @brief Block-initialization, specialized for a "raking" access
* pattern in which each thread block is assigned a consecutive sequence
* of input tiles.
*
* @param[in] block_offset
* Threadblock begin offset (inclusive)
*
* @param[in] block_end
* Threadblock end offset (exclusive)
*/
template <int TILE_ITEMS, typename OffsetT1 = OffsetT>
_CCCL_DEVICE _CCCL_FORCEINLINE void BlockInit(OffsetT1 block_offset, OffsetT1 block_end)
{
this->block_offset = block_offset;
this->block_end = block_end;
this->block_stride = TILE_ITEMS;
}
};
CUB_NAMESPACE_END