矩阵乘法 — Triton Ascend 实现示例
import torch
import triton
import triton.language as tl
@triton.jit
def matmul_kernel(
a_ptr, b_ptr, c_ptr,
M, N, K,
stride_am, stride_ak,
stride_bk, stride_bn,
stride_cm, stride_cn,
CORE_NUM: tl.constexpr,
BLOCK_M: tl.constexpr, BLOCK_K: tl.constexpr, BLOCK_N: tl.constexpr,
):
NUM_BLOCKS_M = tl.cdiv(M, BLOCK_M)
NUM_BLOCKS_N = tl.cdiv(N, BLOCK_N)
NUM_BLOCKS = NUM_BLOCKS_M * NUM_BLOCKS_N
pid = tl.program_id(0)
for block_idx in range(pid, NUM_BLOCKS, CORE_NUM):
bm = block_idx // NUM_BLOCKS_N
bn = block_idx % NUM_BLOCKS_N
acc = tl.zeros((BLOCK_M, BLOCK_N), dtype=tl.float32)
for k in range(0, K, BLOCK_K):
a_off_m = bm * BLOCK_M + tl.arange(0, BLOCK_M)
a_off_k = k + tl.arange(0, BLOCK_K)
a_mask = (a_off_m < M)[:, None] & (a_off_k < K)[None, :]
a = tl.load(a_ptr + a_off_m[:, None] * stride_am
+ a_off_k[None, :] * stride_ak,
mask=a_mask, other=0.0)
b_off_k = k + tl.arange(0, BLOCK_K)
b_off_n = bn * BLOCK_N + tl.arange(0, BLOCK_N)
b_mask = (b_off_k < K)[:, None] & (b_off_n < N)[None, :]
b = tl.load(b_ptr + b_off_k[:, None] * stride_bk
+ b_off_n[None, :] * stride_bn,
mask=b_mask, other=0.0)
acc += tl.dot(a, b)
c_off_m = bm * BLOCK_M + tl.arange(0, BLOCK_M)
c_off_n = bn * BLOCK_N + tl.arange(0, BLOCK_N)
c_mask = (c_off_m < M)[:, None] & (c_off_n < N)[None, :]
tl.store(c_ptr + c_off_m[:, None] * stride_cm
+ c_off_n[None, :] * stride_cn,
acc, mask=c_mask)
class ModelNew(torch.nn.Module):
def __init__(self):
super().__init__()
try:
self.CUBE_CORE_NUM = torch_npu.npu.npu_config.get_device_limit(0).get("cube_core_num", 20)
except:
self.CUBE_CORE_NUM = 20
def forward(self, A, B):
if not A.is_contiguous():
A = A.contiguous()
if not B.is_contiguous():
B = B.contiguous()
M, K = A.shape
_, N = B.shape
C = torch.empty((M, N), dtype=torch.float32, device=A.device)
BLOCK_M, BLOCK_K, BLOCK_N = 128, 256, 128
grid = (self.CUBE_CORE_NUM,)
matmul_kernel[grid](
A, B, C, M, N, K,
A.stride(0), A.stride(1), B.stride(0), B.stride(1),
C.stride(0), C.stride(1),
CORE_NUM=self.CUBE_CORE_NUM,
BLOCK_M=BLOCK_M, BLOCK_K=BLOCK_K, BLOCK_N=BLOCK_N)
return C
1---2name: triton-ascend-example-matmul3description: "标准矩阵乘法的完整 Triton Ascend 实现示例。展示 2D 分块(tiling)、K 维循环累加、2D mask 处理、Cube Core 利用等关键模式。当生成 matmul 类算子时可参考此示例的代码结构。"4category: example5version: "1.0.0"6metadata:7 source: https://skillmd.com/skills/wenyi-li/triton-ascend-example-matmul8 backend: ascend9 dsl: triton_ascend10 hardware: "Atlas A2, Atlas A3"11 operator_type: "matmul"12---1314# 矩阵乘法 — Triton Ascend 实现示例1516```python17import torch18import triton19import triton.language as tl202122@triton.jit23def matmul_kernel(24 a_ptr, b_ptr, c_ptr,25 M, N, K,26 stride_am, stride_ak,27 stride_bk, stride_bn,28 stride_cm, stride_cn,29 CORE_NUM: tl.constexpr,30 BLOCK_M: tl.constexpr, BLOCK_K: tl.constexpr, BLOCK_N: tl.constexpr,31):32 NUM_BLOCKS_M = tl.cdiv(M, BLOCK_M)33 NUM_BLOCKS_N = tl.cdiv(N, BLOCK_N)34 NUM_BLOCKS = NUM_BLOCKS_M * NUM_BLOCKS_N35 pid = tl.program_id(0)3637 for block_idx in range(pid, NUM_BLOCKS, CORE_NUM):38 bm = block_idx // NUM_BLOCKS_N39 bn = block_idx % NUM_BLOCKS_N40 acc = tl.zeros((BLOCK_M, BLOCK_N), dtype=tl.float32)4142 for k in range(0, K, BLOCK_K):43 a_off_m = bm * BLOCK_M + tl.arange(0, BLOCK_M)44 a_off_k = k + tl.arange(0, BLOCK_K)45 a_mask = (a_off_m < M)[:, None] & (a_off_k < K)[None, :]46 a = tl.load(a_ptr + a_off_m[:, None] * stride_am47 + a_off_k[None, :] * stride_ak,48 mask=a_mask, other=0.0)4950 b_off_k = k + tl.arange(0, BLOCK_K)51 b_off_n = bn * BLOCK_N + tl.arange(0, BLOCK_N)52 b_mask = (b_off_k < K)[:, None] & (b_off_n < N)[None, :]53 b = tl.load(b_ptr + b_off_k[:, None] * stride_bk54 + b_off_n[None, :] * stride_bn,55 mask=b_mask, other=0.0)56 acc += tl.dot(a, b)5758 c_off_m = bm * BLOCK_M + tl.arange(0, BLOCK_M)59 c_off_n = bn * BLOCK_N + tl.arange(0, BLOCK_N)60 c_mask = (c_off_m < M)[:, None] & (c_off_n < N)[None, :]61 tl.store(c_ptr + c_off_m[:, None] * stride_cm62 + c_off_n[None, :] * stride_cn,63 acc, mask=c_mask)646566class ModelNew(torch.nn.Module):67 def __init__(self):68 super().__init__()69 try:70 self.CUBE_CORE_NUM = torch_npu.npu.npu_config.get_device_limit(0).get("cube_core_num", 20)71 except:72 self.CUBE_CORE_NUM = 207374 def forward(self, A, B):75 if not A.is_contiguous():76 A = A.contiguous()77 if not B.is_contiguous():78 B = B.contiguous()79 M, K = A.shape80 _, N = B.shape81 C = torch.empty((M, N), dtype=torch.float32, device=A.device)82 BLOCK_M, BLOCK_K, BLOCK_N = 128, 256, 12883 grid = (self.CUBE_CORE_NUM,)84 matmul_kernel[grid](85 A, B, C, M, N, K,86 A.stride(0), A.stride(1), B.stride(0), B.stride(1),87 C.stride(0), C.stride(1),88 CORE_NUM=self.CUBE_CORE_NUM,89 BLOCK_M=BLOCK_M, BLOCK_K=BLOCK_K, BLOCK_N=BLOCK_N)90 return C91```