227 lines
8.8 KiB
Plaintext
227 lines
8.8 KiB
Plaintext
/*
|
|
Pure-C test:
|
|
nvcc -I csrc -arch=sm_89 -O3 \
|
|
--use_fast_math --ptxas-options=-O3 --extra-device-vectorization \
|
|
csrc/tests/gqa_prefill_test.cu -o test && ./test
|
|
*/
|
|
|
|
#include <cstdio>
|
|
#include <cstdlib>
|
|
#include <cmath>
|
|
#include <sys/time.h>
|
|
#include "../kernels/gqa_prefill_attn.cuh"
|
|
#ifndef ASTRAI_NO_MMA
|
|
#include "../kernels/gqa_prefill_attn_mma.cuh"
|
|
#endif
|
|
|
|
static double now_ms() {
|
|
struct timeval tv;
|
|
gettimeofday(&tv, NULL);
|
|
return tv.tv_sec * 1000.0 + tv.tv_usec / 1000.0;
|
|
}
|
|
|
|
// Launch the production prefill path (tensor-core MMA on sm_80+, else the
|
|
// scalar fallback), mirroring dispatch_prefill() in gqa_prefill_attn.cu.
|
|
template <int HEAD_DIM>
|
|
static void launch_prefill(GQAParams& p) {
|
|
#ifndef ASTRAI_NO_MMA
|
|
constexpr int WARPS = 4, BR = 16;
|
|
constexpr int BC = (HEAD_DIM <= 128) ? 32 : 16;
|
|
constexpr int MIN_BLOCKS = (HEAD_DIM <= 32) ? 6 : (HEAD_DIM <= 64) ? 4
|
|
: (HEAD_DIM <= 128) ? 3 : 2;
|
|
dim3 grid((p.q_len + BR * WARPS - 1) / (BR * WARPS), p.q_head, p.batch);
|
|
dim3 block(WARPS * 32, 1, 1);
|
|
gqa_prefill_attn_mma_kernel<HEAD_DIM, WARPS, BC, MIN_BLOCKS><<<grid, block>>>(p);
|
|
#else
|
|
constexpr int G = 8, ROWS = 32, P_BC = 32;
|
|
dim3 grid((p.q_len + ROWS - 1) / ROWS, p.q_head, p.batch);
|
|
dim3 block(G, ROWS, 1);
|
|
gqa_prefill_attn_kernel_t<HEAD_DIM, G, ROWS, P_BC><<<grid, block>>>(p);
|
|
#endif
|
|
}
|
|
|
|
static void dispatch_prefill(GQAParams& p) {
|
|
switch (p.head_dim) {
|
|
case 64: launch_prefill<64>(p); break;
|
|
case 128: launch_prefill<128>(p); break;
|
|
default: printf("bench: unsupported D=%d\n", p.head_dim);
|
|
}
|
|
}
|
|
|
|
static void cpu_attention(const float* Q, const float* K, const float* V, float* O,
|
|
int B, int Hq, int Hk, int q_len, int kv_len, int D,
|
|
int is_causal, int causal_off) {
|
|
float scale = 1.0f / sqrtf((float)D);
|
|
int n_rep = Hq / Hk;
|
|
for (int b = 0; b < B; b++) {
|
|
for (int h = 0; h < Hq; h++) {
|
|
for (int qi = 0; qi < q_len; qi++) {
|
|
int kv_h = h / n_rep;
|
|
float mv = -INFINITY, sv = 0.0f;
|
|
float accum[256] = {0};
|
|
int lim = is_causal ? min(kv_len, qi + causal_off + 1) : kv_len;
|
|
for (int kj = 0; kj < lim; kj++) {
|
|
float dot = 0.0f;
|
|
for (int d = 0; d < D; d++)
|
|
dot += Q[((b*Hq + h)*q_len + qi)*D + d]
|
|
* K[((b*Hk + kv_h)*kv_len + kj)*D + d];
|
|
dot *= scale;
|
|
float nm = fmaxf(mv, dot);
|
|
float al = expf(mv - nm);
|
|
float be = expf(dot - nm);
|
|
sv = sv * al + be;
|
|
for (int d = 0; d < D; d++)
|
|
accum[d] = accum[d] * al
|
|
+ V[((b*Hk + kv_h)*kv_len + kj)*D + d] * be;
|
|
mv = nm;
|
|
}
|
|
float inv = 1.0f / sv;
|
|
for (int d = 0; d < D; d++)
|
|
O[((b*Hq + h)*q_len + qi)*D + d] = accum[d] * inv;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
static __nv_bfloat16 f2bf(float x) { return __float2bfloat16(x); }
|
|
static float bf2f(__nv_bfloat16 x) { return __bfloat162float(x); }
|
|
static float randf() { return (float)rand() / (float)RAND_MAX - 0.5f; }
|
|
|
|
// Warmed-up, CUDA-event timed throughput sweep over the production MMA path.
|
|
// Reports per-call latency and effective tensor-core TFLOP/s (2 matmuls:
|
|
// QK^T and P@V, each 2*B*Hq*ql*kl*D flops; halved for causal).
|
|
static void bench() {
|
|
const int cfgs[][7] = {
|
|
{1,32,4,512,512,128,0},
|
|
{1,32,4,1024,1024,128,0},
|
|
{1,32,4,2048,2048,128,0},
|
|
{1,32,4,2048,2048,128,1},
|
|
{4,32,4,2048,2048,128,1},
|
|
{1,32,4,4096,4096,128,1},
|
|
};
|
|
int n = sizeof(cfgs)/sizeof(cfgs[0]);
|
|
const int WARMUP = 10, ITERS = 50;
|
|
printf("\n===== PREFILL BENCH (warmup=%d iters=%d) =====\n", WARMUP, ITERS);
|
|
printf("%-46s | %10s | %10s | %10s\n",
|
|
"config", "latency", "bandwidth", "throughput");
|
|
printf("---------------------------------------------------------------"
|
|
"----------------------------\n");
|
|
|
|
for (int ci = 0; ci < n; ci++) {
|
|
int B=cfgs[ci][0], Hq=cfgs[ci][1], Hk=cfgs[ci][2];
|
|
int ql=cfgs[ci][3], kl=cfgs[ci][4], D=cfgs[ci][5], causal=cfgs[ci][6];
|
|
size_t nQ=(size_t)B*Hq*ql*D, nKV=(size_t)B*Hk*kl*D;
|
|
|
|
bf16 *dQ,*dK,*dV,*dO,*tmp;
|
|
cudaMalloc(&dQ,nQ*2); cudaMalloc(&dK,nKV*2);
|
|
cudaMalloc(&dV,nKV*2); cudaMalloc(&dO,nQ*2);
|
|
size_t big = nQ>nKV?nQ:nKV; tmp=new bf16[big];
|
|
for (size_t i=0;i<nQ;i++) tmp[i]=f2bf(randf());
|
|
cudaMemcpy(dQ,tmp,nQ*2,cudaMemcpyHostToDevice);
|
|
for (size_t i=0;i<nKV;i++) tmp[i]=f2bf(randf());
|
|
cudaMemcpy(dK,tmp,nKV*2,cudaMemcpyHostToDevice);
|
|
for (size_t i=0;i<nKV;i++) tmp[i]=f2bf(randf());
|
|
cudaMemcpy(dV,tmp,nKV*2,cudaMemcpyHostToDevice);
|
|
|
|
GQAParams p;
|
|
p.batch=B; p.q_head=Hq; p.kv_head=Hk; p.q_len=ql; p.kv_len=kl; p.head_dim=D;
|
|
p.use_mask=0; p.is_causal=causal; p.causal_offset=0;
|
|
p.scale=1.0f/sqrtf((float)D);
|
|
p.q=dQ; p.k=dK; p.v=dV; p.mask=nullptr; p.o=dO;
|
|
|
|
for (int i=0;i<WARMUP;i++) dispatch_prefill(p);
|
|
cudaDeviceSynchronize();
|
|
cudaError_t err=cudaGetLastError();
|
|
if (err!=cudaSuccess){printf("CUDA err: %s\n",cudaGetErrorString(err));return;}
|
|
|
|
cudaEvent_t s,e; cudaEventCreate(&s); cudaEventCreate(&e);
|
|
cudaEventRecord(s);
|
|
for (int i=0;i<ITERS;i++) dispatch_prefill(p);
|
|
cudaEventRecord(e); cudaEventSynchronize(e);
|
|
float ms=0; cudaEventElapsedTime(&ms,s,e); ms/=ITERS;
|
|
|
|
double flops = 4.0*B*Hq*(double)ql*kl*D;
|
|
if (causal) flops *= 0.5;
|
|
double tflops = flops/(ms*1e-3)/1e12;
|
|
// HBM traffic: Q + O (B*Hq*ql*D each) + K + V (B*Hk*kl*D each), bf16.
|
|
double bytes = 2.0 * (2.0*nQ + 2.0*nKV);
|
|
double gbps = bytes/(ms*1e-3)/1e9;
|
|
|
|
char cfg[64];
|
|
snprintf(cfg, sizeof(cfg),
|
|
"B=%2d Hq=%2d Hk=%d q=%4d kv=%4d D=%3d causal=%d",
|
|
B,Hq,Hk,ql,kl,D,causal);
|
|
printf("%-46s | %7.4f ms | %7.1f GB/s | %6.2f TFLOP/s\n",
|
|
cfg, ms, gbps, tflops);
|
|
|
|
cudaFree(dQ);cudaFree(dK);cudaFree(dV);cudaFree(dO);
|
|
delete[]tmp; cudaEventDestroy(s); cudaEventDestroy(e);
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
const int configs[][7] = {
|
|
{1,2,1,64,128,64,0}, // tiny: B,Hq,Hk,q,kv,D,causal
|
|
{1,32,4,512,512,128,0}, // standard
|
|
{1,32,4,128,256,128,0}, // medium
|
|
{1,4,2,256,256,128,1}, // causal
|
|
};
|
|
int n_configs = sizeof(configs) / sizeof(configs[0]);
|
|
|
|
for (int ci = 0; ci < n_configs; ci++) {
|
|
int B=configs[ci][0], Hq=configs[ci][1], Hk=configs[ci][2];
|
|
int ql=configs[ci][3], kl=configs[ci][4], D=configs[ci][5];
|
|
int causal=configs[ci][6];
|
|
printf("=== B=%d Hq=%d Hk=%d q=%d kv=%d D=%d causal=%d ===\n",
|
|
B,Hq,Hk,ql,kl,D,causal);
|
|
|
|
size_t nQ = B*Hq*ql*D, nKV = B*Hk*kl*D;
|
|
float *hQ=new float[nQ], *hK=new float[nKV], *hV=new float[nKV];
|
|
for (size_t i=0;i<nQ;i++) hQ[i]=randf();
|
|
for (size_t i=0;i<nKV;i++){hK[i]=randf();hV[i]=randf();}
|
|
|
|
bf16 *dQ,*dK,*dV,*dO,*tmp;
|
|
cudaMalloc(&dQ,nQ*2); cudaMalloc(&dK,nKV*2);
|
|
cudaMalloc(&dV,nKV*2); cudaMalloc(&dO,nQ*2);
|
|
tmp=new bf16[max(nQ,nKV)];
|
|
for (size_t i=0;i<nQ;i++) tmp[i]=f2bf(hQ[i]);
|
|
cudaMemcpy(dQ,tmp,nQ*2,cudaMemcpyHostToDevice);
|
|
for (size_t i=0;i<nKV;i++) tmp[i]=f2bf(hK[i]);
|
|
cudaMemcpy(dK,tmp,nKV*2,cudaMemcpyHostToDevice);
|
|
for (size_t i=0;i<nKV;i++) tmp[i]=f2bf(hV[i]);
|
|
cudaMemcpy(dV,tmp,nKV*2,cudaMemcpyHostToDevice);
|
|
|
|
GQAParams p;
|
|
p.batch=B; p.q_head=Hq; p.kv_head=Hk; p.q_len=ql; p.kv_len=kl; p.head_dim=D;
|
|
p.use_mask=0; p.is_causal=causal; p.causal_offset=0;
|
|
p.scale=1.0f/sqrtf((float)D);
|
|
p.q=dQ; p.k=dK; p.v=dV; p.mask=nullptr; p.o=dO;
|
|
|
|
double t0=now_ms();
|
|
dispatch_prefill(p);
|
|
cudaDeviceSynchronize();
|
|
double kms=now_ms()-t0;
|
|
cudaError_t err=cudaGetLastError();
|
|
if (err!=cudaSuccess){printf("CUDA err: %s\n",cudaGetErrorString(err));return 1;}
|
|
|
|
bf16* hOut=new bf16[nQ];
|
|
cudaMemcpy(hOut,dO,nQ*2,cudaMemcpyDeviceToHost);
|
|
|
|
float* ref=new float[nQ];
|
|
cpu_attention(hQ,hK,hV,ref,B,Hq,Hk,ql,kl,D,causal,0);
|
|
|
|
float max_err=0;
|
|
for (size_t i=0;i<nQ;i++) {
|
|
float d=fabsf(bf2f(hOut[i])-ref[i]);
|
|
if(d>max_err) max_err=d;
|
|
}
|
|
printf("kernel: %.3f ms max_err: %.6e\n\n",kms,max_err);
|
|
|
|
cudaFree(dQ);cudaFree(dK);cudaFree(dV);cudaFree(dO);
|
|
delete[]hQ;delete[]hK;delete[]hV;delete[]hOut;delete[]ref;delete[]tmp;
|
|
}
|
|
printf("All tests passed!\n");
|
|
bench();
|
|
return 0;
|
|
}
|