import torch
import torch.nn as nn
import torch.nn.functional as F
def module_fn(x: torch.Tensor, dim: int) -> torch.Tensor:
"""
Applies LogSoftmax activation to the input tensor.
Args:
x (torch.Tensor): Input tensor of shape (batch_size, dim)
dim (int): Dimension along which to apply LogSoftmax
Returns:
torch.Tensor: Output tensor with LogSoftmax applied, same shape as input
"""
return F.log_softmax(x, dim=dim)
class Model(nn.Module):
"""
Simple model that performs a LogSoftmax activation.
"""
def __init__(self, dim):
super(Model, self).__init__()
self.dim = dim
def forward(self, x: torch.Tensor, fn=module_fn) -> torch.Tensor:
return fn(x, self.dim)
batch_size = 16
dim = 16384
sm_dim = 1
def get_inputs():
x = torch.randn(batch_size, dim)
return [x]
def get_init_inputs():
return [sm_dim]
import torch
import torch.nn as nn
class Model(nn.Module):
"""
Simple model that performs a LogSoftmax activation.
"""
def __init__(self, dim: int = 1):
super(Model, self).__init__()
self.dim = dim
def forward(self, x: torch.Tensor) -> torch.Tensor:
"""
Applies LogSoftmax activation to the input tensor.
Args:
x (torch.Tensor): Input tensor of shape (batch_size, dim).
Returns:
torch.Tensor: Output tensor with LogSoftmax applied, same shape as input.
"""
return torch.log_softmax(x, dim=self.dim)
batch_size = 16
dim = 16384
sm_dim = 1
def get_inputs():
x = torch.randn(batch_size, dim)
return [x]
def get_init_inputs():
return [sm_dim]
#include <torch/extension.h>
#include <cuda.h>
#include <cuda_runtime.h>
#include <vector>
#include <limits>
#include <cmath>
// This kernel uses stride loops to efficiently handle large workloads,
// ensuring that each thread correctly processes elements beyond its initial allocation.
template <typename scalar_t>
__global__ void log_softmax_forward_kernel_stride(
const scalar_t* __restrict__ input,
scalar_t* __restrict__ output,
const int dim_size) {
// Each block processes one row (batch element)
int batch_idx = blockIdx.x;
const scalar_t* input_row = input + batch_idx * dim_size;
scalar_t* output_row = output + batch_idx * dim_size;
const int tid = threadIdx.x;
const int blockSize = blockDim.x;
const int warpSize = 32;
const unsigned int mask = 0xffffffff;
// Step 1: Compute the maximum value in the row using stride loop
scalar_t local_max = -std::numeric_limits<scalar_t>::infinity();
for (int i = tid; i < dim_size; i += blockSize) {
scalar_t val = input_row[i];
local_max = max(val, local_max);
}
// Warp-level reduction for maximum using shfl_down_sync
for (int offset = warpSize / 2; offset > 0; offset /= 2) {
scalar_t temp = __shfl_down_sync(mask, local_max, offset);
local_max = max(temp, local_max);
}
// Shared memory for warp reduction results
extern __shared__ __align__(sizeof(scalar_t)) unsigned char smem[];
scalar_t* shared_data = reinterpret_cast<scalar_t*>(smem);
if ((tid % warpSize) == 0) {
shared_data[tid / warpSize] = local_max;
}
__syncthreads();
// Final reduction by first thread for block level result
scalar_t global_max;
if (tid == 0) {
global_max = shared_data[0];
int num_warps = (blockSize + warpSize - 1) / warpSize;
for (int i = 1; i < num_warps; ++i) {
global_max = max(shared_data[i], global_max);
}
shared_data[0] = global_max;
}
__syncthreads();
global_max = shared_data[0];
// Step 2: Compute the sum of exp(val - global_max) using stride loop
scalar_t local_sum = 0;
for (int i = tid; i < dim_size; i += blockSize) {
scalar_t exp_val = exp(input_row[i] - global_max);
local_sum += exp_val;
output_row[i] = exp_val; // store intermediate result
}
// Warp-level reduction for sum using shfl_down_sync
for (int offset = warpSize / 2; offset > 0; offset /= 2) {
local_sum += __shfl_down_sync(mask, local_sum, offset);
}
if ((tid % warpSize) == 0) {
shared_data[tid / warpSize] = local_sum;
}
__syncthreads();
scalar_t global_sum;
if (tid == 0) {
global_sum = shared_data[0];
int num_warps = (blockSize + warpSize - 1) / warpSize;
for (int i = 1; i < num_warps; ++i) {
global_sum += shared_data[i];
}
shared_data[0] = log(global_sum);
}
__syncthreads();
scalar_t log_sum = shared_data[0];
// Step 3: Compute final log softmax output using stride loop
for (int i = tid; i < dim_size; i += blockSize) {
output_row[i] = (input_row[i] - global_max) - log_sum;
}
}
// Host function launching the kernel
torch::Tensor log_softmax_cuda_forward_stride(torch::Tensor input, int64_t dim) {
TORCH_CHECK(input.is_cuda(), "input must be a CUDA tensor");
TORCH_CHECK(
input.scalar_type() == torch::kFloat32 || input.scalar_type() == torch::kFloat64,
"input must be float32 or float64");
int64_t ndim = input.dim();
TORCH_CHECK(dim >= -ndim && dim < ndim, "dim out of range");
dim = (dim >= 0) ? dim : dim + ndim;
// Permute input to bring 'dim' to the last dimension
std::vector<int64_t> permute_dims;
for (int64_t i = 0; i < ndim; ++i) {
if (i != dim) {
permute_dims.push_back(i);
}
}
permute_dims.push_back(dim);
input = input.permute(permute_dims).contiguous();
int64_t batch_size = input.numel() / input.size(-1);
int64_t dim_size = input.size(-1);
auto output = torch::empty_like(input);
// Choose number of threads: next power of two of dim_size, capped at 1024
int threads = 1;
while (threads < dim_size) threads <<= 1;
if (threads > 1024) threads = 1024;
// Compute required shared memory: one scalar per warp
int warpSize = 32;
int num_warps = (threads + warpSize - 1) / warpSize;
size_t shared_mem_size = num_warps * sizeof(float); // temporary using float size
AT_DISPATCH_FLOATING_TYPES(input.scalar_type(), "log_softmax_forward_cuda_stride", ([&] {
shared_mem_size = num_warps * sizeof(scalar_t);
log_softmax_forward_kernel_stride<scalar_t><<<batch_size, threads, shared_mem_size>>>(
input.data_ptr<scalar_t>(),
output.data_ptr<scalar_t>(),
dim_size);
}));
// Inverse permutation to restore original shape
std::vector<int64_t> inverse_permute_dims(ndim);
for (size_t i = 0; i < permute_dims.size(); ++i) {
inverse_permute_dims[permute_dims[i]] = i;
}
output = output.permute(inverse_permute_dims);
return output;
}
PYBIND11_MODULE(TORCH_EXTENSION_NAME, m) {
m.def("forward", &log_softmax_cuda_forward_stride, "LogSoftmax forward stride (CUDA)");
}
Metric | Value | Unit | Variance | Samples |
---|---|---|---|---|
Executed Ipc Active | 1.522 | inst/cycle | 0.000 | 5 |
Executed Ipc Elapsed | 0.140 | inst/cycle | 0.000 | 5 |
Issue Slots Busy | 38.186 | % | 0.015 | 5 |
Issued Ipc Active | 1.526 | inst/cycle | 0.000 | 5 |
SM Busy | 38.186 | % | 0.015 | 5 |
Memory Throughput | 113758288466.052 | byte/second | 497731668990969664.000 | 5 |
Mem Busy | 6.296 | % | 0.002 | 5 |
Max Bandwidth | 7.614 | % | 0.003 | 5 |
L1/TEX Hit Rate | 60.000 | % | 0.000 | 5 |
L2 Hit Rate | 76.488 | % | 0.067 | 5 |
Mem Pipes Busy | 2.518 | % | 0.000 | 5 |
Warp Cycles Per Issued Instruction | 20.772 | cycle | 0.168 | 5 |
Warp Cycles Per Executed Instruction | 20.850 | cycle | 0.168 | 5 |
Avg. Active Threads Per Warp | 31.620 | 0.000 | 5 | |
Avg. Not Predicated Off Threads Per Warp | 29.650 | 0.000 | 5 | |
Max Active Clusters | 0.000 | cluster | 0.000 | 5 |
Max Cluster Size | 8.000 | block | 0.000 | 5 |
Overall GPU Occupancy | 0.000 | % | 0.000 | 5 |
Cluster Occupancy | 0.000 | % | 0.000 | 5 |
Block Limit SM | 32.000 | block | 0.000 | 5 |
Block Limit Registers | 2.000 | block | 0.000 | 5 |
Block Limit Shared Mem | 7.000 | block | 0.000 | 5 |
Block Limit Warps | 2.000 | block | 0.000 | 5 |
Theoretical Active Warps per SM | 64.000 | warp | 0.000 | 5 |
Theoretical Occupancy | 100.000 | % | 0.000 | 5 |
Achieved Occupancy | 48.992 | % | 0.000 | 5 |
Achieved Active Warps Per SM | 31.356 | warp | 0.000 | 5 |
Rule | Description |
---|---|
INF HighPipeUtilization | ALU is the highest-utilized pipeline (25.4%) based on active cycles, taking into account the rates of its different instructions. It executes integer and logic operations. It is well-utilized, but should not be a bottleneck. |
WRN Occupancy | This kernel's theoretical occupancy is not impacted by any block limit. The difference between calculated theoretical (100.0%) and measured achieved occupancy (49.0%) can be the result of warp scheduling overheads or workload imbalances during the kernel execution. Load imbalances can occur between warps within a block as well as across blocks of the same kernel. See the CUDA Best Practices Guide (https://docs.nvidia.com/cuda/cuda-c-best-practices-guide/index.html#occupancy) for more details on optimizing occupancy. |
Operation / Metric | Value | Unit |
---|---|---|
aten::to | ||
CPU Time | 569203.54 | μs |
Device Time | 44.74 | μs |
Self CPU Time | 41.81 | μs |
Self Device Time | 0.00 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
aten::_to_copy | ||
CPU Time | 569161.73 | μs |
Device Time | 44.74 | μs |
Self CPU Time | 91.27 | μs |
Self Device Time | 0.00 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
aten::empty_strided | ||
CPU Time | 588750.56 | μs |
Device Time | 0.00 | μs |
Self CPU Time | 20055.85 | μs |
Self Device Time | 0.00 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
cudaDeviceGetStreamPriorityRange | ||
CPU Time | 568319.09 | μs |
Device Time | 0.00 | μs |
Self CPU Time | 568319.09 | μs |
Self Device Time | 0.00 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
cudaLaunchKernel | ||
CPU Time | 450100.24 | μs |
Device Time | 20817.65 | μs |
Self CPU Time | 450100.24 | μs |
Self Device Time | 20817.65 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
void log_softmax_forward_kernel_stride<float>(float const*, float*, int) | ||
CPU Time | 0.00 | μs |
Device Time | 59264.12 | μs |
Self CPU Time | 0.00 | μs |
Self Device Time | 59264.12 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
cudaEventRecord | ||
CPU Time | 17511.31 | μs |
Device Time | 40914.94 | μs |
Self CPU Time | 17511.31 | μs |
Self Device Time | 40914.94 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
aten::zero_ | ||
CPU Time | 62410.53 | μs |
Device Time | 598867.07 | μs |
Self CPU Time | 12033.15 | μs |
Self Device Time | 0.00 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
aten::fill_ | ||
CPU Time | 50379.18 | μs |
Device Time | 598867.07 | μs |
Self CPU Time | 17352.29 | μs |
Self Device Time | 598867.07 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
void at::native::vectorized_elementwise_kernel<4, at::native::FillFunctor<int>, at::detail::Array<char*, 1> >(int, at::native::FillFunctor<int>, at::detail::Array<char*, 1>) | ||
CPU Time | 0.00 | μs |
Device Time | 598867.07 | μs |
Self CPU Time | 0.00 | μs |
Self Device Time | 598867.07 | μs |
CPU Memory Usage | 0 | B |
Device Memory Usage | 0 | B |
Self CPU Memory Usage | 0 | B |
Self Device Memory Usage | 0 | B |
45282 warnings generated when compiling for host. Suppressed 45322 warnings (45275 in non-user code, 47 NOLINT). Use -header-filter=.* to display errors from all non-system headers. Use -system-headers to display errors from system headers as well.