Datasets:
File size: 5,072 Bytes
09a9a96 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 | ---
license: mit
pretty_name: KernelStrain
task_categories:
- text-generation
tags:
- code
- cuda
- triton
- gpu-kernels
- kernel-optimization
- synthetic-dataset
- sft
- pytorch
- llm-training
size_categories:
- 100K<n<1M
configs:
- config_name: episodes
data_files:
- split: train
path: episodes.jsonl
- config_name: sft_multiturn
data_files:
- split: train
path: sft_multiturn.jsonl
- config_name: sft_steps
data_files:
- split: train
path: sft_steps.jsonl
- config_name: holdout
data_files:
- split: test
path: tasks_holdout.jsonl
---
# KernelStrain
**Long-horizon GPU kernel optimization trajectories for training small models to iterate on CUDA and Triton kernels.**
KernelStrain is a large synthetic dataset of kernel-optimization episodes: given a kernel task (shapes, dtype, GPU target, baseline code + timing), a model proposes successive *complete* kernel candidates, observes simulated benchmark / correctness / compile feedback, and keeps improving over many steps — structural rewrites, parameter sweeps, joint configs, rebenchmarks, and endgame fine-tuning.
Built to teach a small model the *loop* of kernel work: propose → measure → regress → revert → recover → repeat, for tens of steps per task.
> ⚠️ **All benchmark numbers are produced by an analytic roofline-style simulator — no kernel in this dataset was ever compiled or executed.** Timings are plausible, not measured. Kernel source is realistic-looking but unverified; use it for training dynamics, not as production code.
## At a glance
| | |
|---|---|
| Episodes | 11,514 |
| SFT step rows | ~282k |
| Multiturn conversations | 11,514 |
| Holdout tasks | 185 (descriptions only, no solutions) |
| Op modules | 57 (45 distinct ops × CUDA/Triton impls) |
| Avg steps / episode | ~24.5 |
| Step statuses | ~94% ok, ~2.6% wrong-result, ~3.3% compile-error |
| GPU targets | A100 (sm_80), H100 (sm_90), RTX 4090, MI300X (gfx942) |
## Coverage
Kernels spanning AI **inference and training**:
- **Attention**: flash prefill, paged decode, MLA decode (latent KV), sliding-window, cross-attention, tree attention (speculative decoding), flash attention backward
- **Norms**: RMSNorm, LayerNorm, fused add+RMSNorm, LayerNorm backward
- **Activations/fusions**: SwiGLU fwd/bwd, bias+GELU, dropout (Philox)
- **Matmul**: fp16 GEMM/GEMV, int4/int8 GEMM, fp8 GEMM, blockwise-scaled fp8 GEMM (DeepGEMM-style), grouped GEMM
- **Training**: AdamW, Adafactor, grad clipping, cross-entropy fwd/bwd, embedding fwd/bwd, reductions, prefix scan
- **Quant**: fp8 tensor quant, int8 KV-cache quant
- **Sampling**: top-k, nucleus (top-p) — sort, histogram-refine, and CDF-pick strategies
- **SSM/conv**: Mamba selective scan (CUDA + Triton), causal Conv1D
- **MoE**: scatter, grouped GEMM, combine
- **Misc**: RoPE, transpose, KV-cache append, embedding gather
Optimization patterns exercised: vectorized loads (uint4/float4/half2), shared-memory staging, cp.async pipelines, TMA, warp shuffles, online softmax, split-K/split-KV with combine kernels, persistent kernels, tensor-core mma/wgmma, atomics, multi-kernel decompositions, occupancy/tile tuning — plus realistic failures: arch-gated compile errors (sm_90-only wgmma, no fp8 on A100, PTX on ROCm), shared-memory overflows, and wrong-result regressions that get reverted.
## Files
| file | format | contents |
|---|---|---|
| `episodes.jsonl` | jsonl | Raw episodes — every step with full source, params, status, timing, smem, keep/revert decisions |
| `sft_multiturn.jsonl` | chat | Multi-turn conversations; assistant turns contain **complete kernel code only** (no reasoning traces) |
| `sft_steps.jsonl` | chat | One row per transition: task + history + current-best → next candidate |
| `tasks_holdout.jsonl` | jsonl | Held-out task prompts without solutions (~8% of combos) |
| `stats.json` | json | Generation statistics |
Feedback messages report **best-so-far** only — no future information leaks into context.
## Usage
```python
from datasets import load_dataset
# step-level SFT rows
ds = load_dataset("Akahsizrr/kernelstrain", "sft_steps", split="train")
# full multiturn episodes
mt = load_dataset("Akahsizrr/kernelstrain", "sft_multiturn", split="train")
```
## Generation
Pure-stdlib simulator: `time = max(memory_time, compute_time) + launch_overhead`, with GPU-specific peaks, tunable efficiency scaling, arch/smem gates, and Gaussian rebench noise. Deterministic from seed. Source: the `kernelstrain` generator.
## Caveats
- Perf numbers are analytic-model-plausible, **not measured** — the simulator can occasionally rank variants differently than real hardware would.
- Kernel code is unverified; some templates may contain bugs that a real compiler would catch.
- Assistant outputs are intentionally code-only; there are no reasoning/CoT traces by design.
## License
MIT
|