submission 74913
yue · python · License unknown
Use it
Vendorable · source mirrored · license unknownView source →
No package. Vendor the mirrored source: 276 lines, June 9 Researcher Reciprocity License v1.0.
cute_avoidconvert.py
curl "https://kernelindex.com/api/v1/implementations/kernelbot-nvfp4-gemv-74913?include=source"interfacepython
Compatibility
measured onNVIDIA B200
declared hardwareNVIDIA B200
architecturessm_100
dtypesfp8_e4m3, nvfp4
Benchmark evidence
1 measurement across 1 GPU, fastest first.
Operation / workload
Hardware
Latency
Rank
Observed
Reported · How evidence levels are derived →
Source and license
sourceavailable
revision digestsha256:c87d247ad211b182d7a9816352602711c36e6d45eba041990f9ad1d13b9cfaff
license declaredunknown
license concludedunknown
authorsyue
imported2026-08-15
Techniques
Extracted from the mirrored source by pattern, never inferred. Each row cites its line.
fp4
ab_dtype = cutlass.Float4E2M1FN # FP4 data type for A and BKernel source
cute_avoidconvert.py276 lines
import torch
from task import input_t, output_t
import cutlass
import cutlass.cute as cute
from cutlass.cute.runtime import make_ptr
import cutlass.utils.blockscaled_layout as blockscaled_utils
# Kernel configuration parameters
m_dim = 128
mma_tiler_mnk = (m_dim, 1, 128) # Tile sizes for M, N, K dimensions
ab_dtype = cutlass.Float4E2M1FN # FP4 data type for A and B
sf_dtype = cutlass.Float8E4M3FN # FP8 data type for scale factors
c_dtype = cutlass.Float16 # FP16 output type
sf_vec_size = 16 # Scale factor block size (16 elements share one scale)
threads_per_cta = m_dim # Number of threads per CUDA thread block
# Helper function for ceiling division
def ceil_div(a, b):
return (a + b - 1) // b
# The optimized CuTe implementation for NVFP4 block-scaled GEMV
@cute.kernel
def kernel(
mA_mkl: cute.Tensor,
mB_nkl: cute.Tensor,
mSFA_mkl: cute.Tensor,
mSFB_nkl: cute.Tensor,
mC_mnl: cute.Tensor,
):
# Get CUDA block and thread indices
bidx, bidy, bidz = cute.arch.block_idx()
tidx, _, _ = cute.arch.thread_idx()
# Extract the local tile for input matrix A (shape: [block_M, block_K, rest_M, rest_K, rest_L])
gA_mkl = cute.local_tile(
mA_mkl, cute.slice_(mma_tiler_mnk, (None, 0, None)), (None, None, None)
)
# Extract the local tile for scale factor tensor for A with optimized tiling
# OPTIMIZATION: Use reduced K dimension for scale factors (64 // 16 = 4)
sf_tiler_mnk = (mma_tiler_mnk[0], mma_tiler_mnk[1], mma_tiler_mnk[2] // sf_vec_size)
gSFA_mkl = cute.local_tile(
mSFA_mkl, cute.slice_(sf_tiler_mnk, (None, 0, None)), (None, None, None)
)
# Extract the local tile for input matrix B (shape: [block_N, block_K, rest_N, rest_K, rest_L])
gB_nkl = cute.local_tile(
mB_nkl, cute.slice_(mma_tiler_mnk, (0, None, None)), (None, None, None)
)
# Extract the local tile for scale factor tensor for B with optimized tiling
gSFB_nkl = cute.local_tile(
mSFB_nkl, cute.slice_(sf_tiler_mnk, (0, None, None)), (None, None, None)
)
# Extract the local tile for output matrix C (shape: [block_M, block_N, rest_M, rest_N, rest_L])
gC_mnl = cute.local_tile(
mC_mnl, cute.slice_(mma_tiler_mnk, (None, None, 0)), (None, None, None)
)
# Select output element corresponding to this thread and block indices
tCgC = gC_mnl[tidx, None, bidx, bidy, bidz]
tCgC = cute.make_tensor(tCgC.iterator, 1)
res = cute.zeros_like(tCgC, cutlass.Float32)
# Get the number of k tiles (depth dimension) for the reduction loop
k_tile_cnt = gA_mkl.layout[3].shape
for k_tile in range(k_tile_cnt):
# Load data tile (128 elements)
tAgA = gA_mkl[tidx, None, bidx, k_tile, bidz]
tBgB = gB_nkl[0, None, bidy, k_tile, bidz]
# Load scale factor tile (4 scale factors for the 128 elements)
# OPTIMIZATION: Use k_tile directly since both tensors have same number of tiles
tAgSFA = gSFA_mkl[tidx, None, bidx, k_tile, bidz]
tBgSFB = gSFB_nkl[0, None, bidy, k_tile, bidz]
# Create register tensors - keep structure similar to original
tArA = cute.make_rmem_tensor_like(tAgA, cutlass.Float16)
tBrB = cute.make_rmem_tensor_like(tBgB, cutlass.Float16)
tArSFA = cute.make_rmem_tensor_like(tAgSFA, cutlass.Float32)
tBrSFB = cute.make_rmem_tensor_like(tBgSFB, cutlass.Float32)
# Load values from global memory
a_val_nvfp4 = tAgA.load()
b_val_nvfp4 = tBgB.load()
sfa_val_fp8 = tAgSFA.load()
sfb_val_fp8 = tBgSFB.load()
# OPTIMIZATION: Fuse conversion with store operations
tArA.store(a_val_nvfp4.to(cutlass.Float16))
tBrB.store(b_val_nvfp4.to(cutlass.Float16))
tArSFA.store(sfa_val_fp8.to(cutlass.Float32))
tBrSFB.store(sfb_val_fp8.to(cutlass.Float32))
# OPTIMIZED ACCUMULATION: Fuse operations in inner loop
num_sf_blocks = mma_tiler_mnk[2] // sf_vec_size
for sf_block in cutlass.range_constexpr(num_sf_blocks):
scale_prod = tArSFA[sf_block] * tBrSFB[sf_block]
base = sf_block * sf_vec_size
# OPTIMIZATION: Use fused multiply-add pattern
for offset in cutlass.range_constexpr(sf_vec_size):
element_idx = base + offset
# Fuse: res += scale_prod * (a * b)
res += scale_prod * (tArA[element_idx] * tBrB[element_idx])
# Store the final float16 result back to global memory
tCgC.store(res.to(cutlass.Float16))
return
@cute.jit
def my_kernel(
a_ptr: cute.Pointer,
b_ptr: cute.Pointer,
sfa_ptr: cute.Pointer,
sfb_ptr: cute.Pointer,
c_ptr: cute.Pointer,
problem_size: tuple,
):
"""
Host-side JIT function to prepare tensors and launch GPU kernel.
"""
m, _, k, l = problem_size
# Create CuTe Tensor via pointer and problem size.
a_tensor = cute.make_tensor(
a_ptr,
cute.make_layout(
(m, cute.assume(k, 32), l),
stride=(cute.assume(k, 32), 1, cute.assume(m * k, 32)),
),
)
# We use n=128 to create the torch tensor to do fp4 computation via torch._scaled_mm
# then copy torch tensor to cute tensor for cute customize kernel computation
# therefore we need to ensure b_tensor has the right stride with this 128 padded size on n.
n_padded_128 = 128
b_tensor = cute.make_tensor(
b_ptr,
cute.make_layout(
(n_padded_128, cute.assume(k, 32), l),
stride=(cute.assume(k, 32), 1, cute.assume(n_padded_128 * k, 32)),
),
)
c_tensor = cute.make_tensor(
c_ptr, cute.make_layout((cute.assume(m, 32), 1, l), stride=(1, 1, m))
)
k_sf = k // sf_vec_size
# K-major order for scale factors: K//16 dimension is NOT contiguous!
# For [M, K//16, L] in K-major
sfa_tensor = cute.make_tensor(
sfa_ptr,
cute.make_layout(
(m, k_sf, l),
stride=(k_sf, 1, m * k_sf)
)
)
# For [1, K//16, L] in K-major
sfb_tensor = cute.make_tensor(
sfb_ptr,
cute.make_layout(
(n_padded_128, k_sf, l),
stride=(k_sf, 1, n_padded_128 * k_sf)
)
)
# Compute grid dimensions
# Grid is (M_blocks, 1, L) where:
# - M_blocks = ceil(M / 128) to cover all output rows
# - L = batch size
grid = (
cute.ceil_div(c_tensor.shape[0], m_dim),
1,
c_tensor.shape[2],
)
# Launch the CUDA kernel
kernel(a_tensor, b_tensor, sfa_tensor, sfb_tensor, c_tensor).launch(
grid=grid,
block=[threads_per_cta, 1, 1],
cluster=(1, 1, 1),
)
return
# Global cache for compiled kernel
_compiled_kernel_cache = None
def compile_kernel():
"""
Compile the kernel once and cache it.
This should be called before any timing measurements.
Returns:
The compiled kernel function
"""
global _compiled_kernel_cache
if _compiled_kernel_cache is not None:
return _compiled_kernel_cache
# Create CuTe pointers for A/B/C/SFA/SFB via torch tensor data pointer
a_ptr = make_ptr(ab_dtype, 0, cute.AddressSpace.gmem, assumed_align=16)
b_ptr = make_ptr(ab_dtype, 0, cute.AddressSpace.gmem, assumed_align=16)
c_ptr = make_ptr(c_dtype, 0, cute.AddressSpace.gmem, assumed_align=16)
sfa_ptr = make_ptr(sf_dtype, 0, cute.AddressSpace.gmem, assumed_align=32)
sfb_ptr = make_ptr(sf_dtype, 0, cute.AddressSpace.gmem, assumed_align=32)
# Compile the kernel
_compiled_kernel_cache = cute.compile(
my_kernel, a_ptr, b_ptr, sfa_ptr, sfb_ptr, c_ptr, (0, 0, 0, 0)
)
return _compiled_kernel_cache
def custom_kernel(data: input_t) -> output_t:
"""
Execute the block-scaled GEMV kernel.
This is the main entry point called by the evaluation framework.
It converts PyTorch tensors to CuTe tensors, launches the kernel,
and returns the result.
Args:
data: Tuple of (a, b, sfa_cpu, sfb_cpu, c) PyTorch tensors
a: [m, k, l] - Input matrix in float4e2m1fn
b: [1, k, l] - Input vector in float4e2m1fn
sfa_cpu: [m, k, l] - Scale factors in float8_e4m3fn
sfb_cpu: [1, k, l] - Scale factors in float8_e4m3fn
sfa_permuted: [32, 4, rest_m, 4, rest_k, l] - Scale factors in float8_e4m3fn
sfb_permuted: [32, 4, rest_n, 4, rest_k, l] - Scale factors in float8_e4m3fn
c: [m, 1, l] - Output vector in float16
Returns:
Output tensor c with computed GEMV results
"""
a, b, sfa_cpu, sfb_cpu, _, _, c = data
# Ensure kernel is compiled (will use cached version if available)
# To avoid the compilation overhead, we compile the kernel once and cache it.
compiled_func = compile_kernel()
# Get dimensions from MxKxL layout
m, k, l = a.shape
# Torch use e2m1_x2 data type, thus k is halved
k = k * 2
# GEMV N dimension is always 1
n = 1
# Create CuTe pointers for A/B/C/SFA/SFB via torch tensor data pointer
a_ptr = make_ptr(ab_dtype, a.data_ptr(), cute.AddressSpace.gmem, assumed_align=16)
b_ptr = make_ptr(ab_dtype, b.data_ptr(), cute.AddressSpace.gmem, assumed_align=16)
c_ptr = make_ptr(c_dtype, c.data_ptr(), cute.AddressSpace.gmem, assumed_align=16)
sfa_ptr = make_ptr(
sf_dtype, sfa_cpu.data_ptr(), cute.AddressSpace.gmem, assumed_align=32
)
sfb_ptr = make_ptr(
sf_dtype, sfb_cpu.data_ptr(), cute.AddressSpace.gmem, assumed_align=32
)
# Execute the compiled kernel
compiled_func(a_ptr, b_ptr, sfa_ptr, sfb_ptr, c_ptr, (m, n, k, l))
return cscrolls · 276 lines total
Source code from GPU Mode and the KernelBot dataset · June 9 Researcher Reciprocity License v1.0
Changes from previous submission
Against this author's previous submission submission 71484.
⋯ 68 unchanged linesk_tile_cnt = gA_mkl.layout[3].shapefor k_tile in range(k_tile_cnt):- # Load data tile (64 elements)+ # Load data tile (128 elements)tAgA = gA_mkl[tidx, None, bidx, k_tile, bidz]tBgB = gB_nkl[0, None, bidy, k_tile, bidz]- # Load scale factor tile (4 scale factors for the 64 elements)+ # Load scale factor tile (4 scale factors for the 128 elements)# OPTIMIZATION: Use k_tile directly since both tensors have same number of tilestAgSFA = gSFA_mkl[tidx, None, bidx, k_tile, bidz]tBgSFB = gSFB_nkl[0, None, bidy, k_tile, bidz]- # Create register tensors- tArA = cute.make_rmem_tensor_like(tAgA, cutlass.Float32)- tBrB = cute.make_rmem_tensor_like(tBgB, cutlass.Float32)- tArSFA = cute.make_rmem_tensor_like(tAgSFA, cutlass.Float32) # Only 4 elements now!- tBrSFB = cute.make_rmem_tensor_like(tBgSFB, cutlass.Float32) # Only 4 elements now!+ # Create register tensors - keep structure similar to original+ tArA = cute.make_rmem_tensor_like(tAgA, cutlass.Float16)+ tBrB = cute.make_rmem_tensor_like(tBgB, cutlass.Float16)+ tArSFA = cute.make_rmem_tensor_like(tAgSFA, cutlass.Float32)+ tBrSFB = cute.make_rmem_tensor_like(tBgSFB, cutlass.Float32)# Load values from global memorya_val_nvfp4 = tAgA.load()⋯ 1 unchanged linessfa_val_fp8 = tAgSFA.load()sfb_val_fp8 = tBgSFB.load()- # Convert loaded values to float32 for computation (FFMA)- a_val = a_val_nvfp4.to(cutlass.Float32)- b_val = b_val_nvfp4.to(cutlass.Float32)- sfa_val = sfa_val_fp8.to(cutlass.Float32)- sfb_val = sfb_val_fp8.to(cutlass.Float32)+ # OPTIMIZATION: Fuse conversion with store operations+ tArA.store(a_val_nvfp4.to(cutlass.Float16))+ tBrB.store(b_val_nvfp4.to(cutlass.Float16))+ tArSFA.store(sfa_val_fp8.to(cutlass.Float32))+ tBrSFB.store(sfb_val_fp8.to(cutlass.Float32))- # Store the converted values to RMEM CuTe tensors- tArA.store(a_val)- tBrB.store(b_val)- tArSFA.store(sfa_val)- tBrSFB.store(sfb_val)+ # OPTIMIZED ACCUMULATION: Fuse operations in inner loop+ num_sf_blocks = mma_tiler_mnk[2] // sf_vec_size+ for sf_block in cutlass.range_constexpr(num_sf_blocks):+ scale_prod = tArSFA[sf_block] * tBrSFB[sf_block]+ base = sf_block * sf_vec_size- # Iterate over the 64 data elements and compute accumulation- # OPTIMIZATION: Simple mapping within each k_tile- for i in cutlass.range_constexpr(mma_tiler_mnk[2]):- # Each 16 consecutive elements share one scale factor- sf_idx = i // sf_vec_size # 0-15 -> 0, 16-31 -> 1, 32-47 -> 2, 48-63 -> 3- res += tArA[i] * tArSFA[sf_idx] * tBrB[i] * tBrSFB[sf_idx]+ # OPTIMIZATION: Use fused multiply-add pattern+ for offset in cutlass.range_constexpr(sf_vec_size):+ element_idx = base + offset+ # Fuse: res += scale_prod * (a * b)+ res += scale_prod * (tArA[element_idx] * tBrB[element_idx])# Store the final float16 result back to global memorytCgC.store(res.to(cutlass.Float16))
scrolls · 68 diff lines total
Best evidence level for this revision: reported
JSON