What problem does it solve?
Optimizing cuTile GPU kernels requires deep knowledge of TMA, tile sizes, occupancy, autotuning, and IR-level debugging, and ad-hoc tuning often regresses correctness or wastes effort on low-impact changes.
Core Features & Use Cases
- Structured Experiment Loop: Applies one optimization per iteration from a playbook (TMA conversion, persistent scheduling, autotune configs, latency hints, flush_to_zero, and more), verifying correctness and benchmarking latency each time.
- Tracked Results: Records every iteration in a perf_results.md table with latency, correctness, and keep/revert status, with clear decision rules for accepting or reverting changes.
- Deep Reference Library: Ships an optimization playbook, performance knobs catalog, cuTile API reference with 18 critical rules, performance model, and IR dump/analysis guide.
- Use Case: Ask your agent to optimize a memory-bound rms_norm cuTile kernel in TileGym; it creates a branch, establishes a baseline, then iteratively applies TMA and persistent scheduling while keeping latency and correctness regressions in check.
Quick Start
Ask your agent to optimize the cuTile kernel for a specific TileGym operator and iteratively benchmark it on a GPU node.