submission 344272
savik · python · License unknown
Use it
Vendorable · source mirrored · license unknownView source →
No package. Vendor the mirrored source: 118 lines, June 9 Researcher Reciprocity License v1.0.
sub_v1.py
curl "https://kernelindex.com/api/v1/implementations/kernelbot-nvfp4-dual-gemm-344272?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:5c775e6c44c91e2892e7f7a31c119713613497c96f302208e5caabc89b51a860
license declaredunknown
license concludedunknown
authorssavik
imported2026-08-26
Kernel source
sub_v1.py118 lines
#!POPCORN leaderboard nvfp4_dual_gemm
# This is a submission template for popcorn leaderboard 'nvfp4_dual_gemm'.
# Your task is as follows:
# >
# > You will implement a block scaled dual matrix-matrix multiplication kernel with silu activation optimized for NVIDIA B200.
# > To be explicit, you will be given a tuple of tensors:
# > ```
# > (a, b1, b2, sfa, sfb1, sfb2, c)
# > ```
# > where:
# > * `a` is M x K x L in K-major order in nvfp4(e2m1)
# > * `b1` is N x K x L in K-major order in nvfp4(e2m1)
# > * `b2` is N x K x L in K-major order in nvfp4(e2m1)
# > * `sfa` is M x (K // 16) x L in K-major order in fp8(e4m3fnuz)
# > * `sfb1` is N x (K // 16) x L in K-major order in fp8(e4m3fnuz)
# > * `sfb2` is N x (K // 16) x L in K-major order in fp8(e4m3fnuz)
# > * `c` is M x N x L in fp16
# >
# > Matrix sizes `M` is divisible by mma_tiler_mn[0], `N` is divisible by mma_tiler_mn[1], `K` is divisible by 256.
# > The ranking criteria is the geometric mean of the benchmark results.
# > For the grand price, your kernel will be evaluated against the speed of light analysis
# > and the solution closest to the speed of light will be awarded the grand price.
# > ```
# > The speed of light analysis based on the max(FP4 Tensor Core math throughput, DRAM memory throughput) of B200 and tested under 1.5Ghz clock:
# > M N K L time[us]
# > 256 4096 7168 1 4.708
# > 512 4096 7168 1 8.714
# > 256 3072 4096 1 2.125
# > 512 3072 7168 1 6.535
# > ```
# The deadline for this leaderboard is 2026-01-17 07:59:00+00:00
# You can automatically route this file to specific GPUs by adding a line
# `#!POPCORN gpus <GPUs>` to the header of this file.
# Happy hacking!
import torch
from task import input_t, output_t
from utils import make_match_reference
# Scaling factor vector size
sf_vec_size = 16
# Helper function for ceiling division
def ceil_div(a, b):
return (a + b - 1) // b
# Helper function to convert scale factor tensor to blocked format
def to_blocked(input_matrix):
rows, cols = input_matrix.shape
# Please ensure rows and cols are multiples of 128 and 4 respectively
n_row_blocks = ceil_div(rows, 128)
n_col_blocks = ceil_div(cols, 4)
padded = input_matrix
blocks = padded.view(n_row_blocks, 128, n_col_blocks, 4).permute(0, 2, 1, 3)
rearranged = blocks.reshape(-1, 4, 32, 4).transpose(1, 2).reshape(-1, 32, 16)
return rearranged.flatten()
def custom_kernel(data: input_t) -> output_t:
"""
Args:
data: Tuple that expands to:
a: torch.Tensor[float4e2m1fn] of shape [m, k, l],
b1: torch.Tensor[float4e2m1fn] of shape [n, k, l],
b2: torch.Tensor[float4e2m1fn] of shape [n, k, l],
sfa: torch.Tensor[float8_e4m3fnuz] of shape [m, k // 16, l], used by reference implementation
sfb1: torch.Tensor[float8_e4m3fnuz] of shape [n, k // 16, l], used by reference implementation
sfb2: torch.Tensor[float8_e4m3fnuz] of shape [n, k // 16, l], used by reference implementation
sfa_permuted: torch.Tensor[float8_e4m3fnuz] of shape [32, 4, rest_m, 4, rest_k, l],
sfb1_permuted: torch.Tensor[float8_e4m3fnuz] of shape [32, 4, rest_n, 4, rest_k, l],
sfb2_permuted: torch.Tensor[float8_e4m3fnuz] of shape [32, 4, rest_n, 4, rest_k, l],
c: torch.Tensor[float16] of shape [m, n, l]
Returns:
Tensor containing output in float16
c: torch.Tensor[float16] of shape [m, n, l]
"""
# c: [m, n, l] is pre-allocated memory to avoid timing allocation overhead.
a, b1, b2, sfa_cpu, sfb1_cpu, sfb2_cpu, _, _, _, c = data
# Your implementation here
# Get dimensions from MxNxL layout
m, n, l = c.shape
a2d = a[:, :, 0]
b12dT = b1[:, :, 0].transpose(0, 1) # (k, n)
b22dT = b2[:, :, 0].transpose(0, 1) # (k, n)
# Pack scale factors once (CPU pack -> single H2D copy each)
scale_a = to_blocked(sfa_cpu[:, :, 0]).cuda()
scale_b1 = to_blocked(sfb1_cpu[:, :, 0]).cuda()
scale_b2 = to_blocked(sfb2_cpu[:, :, 0]).cuda()
# Two scaled GEMMs (FP4 TC path), accumulate to FP32
res1 = torch._scaled_mm(
a2d,
b12dT,
scale_a,
scale_b1,
bias=None,
out_dtype=torch.float32,
)
res2 = torch._scaled_mm(
a2d,
b22dT,
scale_a,
scale_b2,
bias=None,
out_dtype=torch.float32,
)
# Epilogue: silu(res1) * res2 -> FP16
c[:, :, 0] = (torch.nn.functional.silu(res1) * res2).to(torch.float16)
return c
scrolls · 118 lines total
Source code from GPU Mode and the KernelBot dataset · June 9 Researcher Reciprocity License v1.0
Best evidence level for this revision: reported
JSON