tritonBLAS: Triton-based Analytical Approach for GEMM Kernel Parameter Selection
Ryan Swann, Muhammad Osama, Xiaohu Guo, Bryant Nelson, Lixun Zhang, Alex Brown, Yen Ong, Ali Yazdani, Sean Siddens, Ganesh Dasika, Alex Underwood
TL;DR
The paper tackles the autotuning overhead in GPU GEMM kernel parameter selection by introducing tritonBLAS, a deterministic analytical model that predicts near-optimal tiling configurations without runtime benchmarking. Built atop Triton, it replaces empirical search with a latency-based, architecture-aware framework that accounts for hierarchical tiling, parallelism, and data locality. Evaluations across 150k GEMM shapes and Llama3 workloads show ~94.7% efficiency compared to exhaustive autotuning, with dramatically reduced configuration overhead and strong cross-architecture portability. The approach offers a practical drop-in alternative for production HPC/ML workloads, enabling fast, predictable GEMM performance without autotuning costs.
Abstract
We present tritonBLAS, a fast and deterministic analytical model that uses architectural parameters like the cache hierarchy, and relative code and data placement to generate performant GPU GEMM kernels. tritonBLAS explicitly models the relationship between architectural topology, matrix shapes, and algorithmic blocking behavior to predict near-optimal configurations without runtime autotuning. Based on this model, we developed and implemented a lightweight GEMM framework entirely within Triton. We evaluate the performance of tritonBLAS across a diverse set of GEMM problem sizes on modern GPUs. tritonBLAS achieves over 95% of the performance of autotuning solutions, while reducing autotuning time to zero. This makes tritonBLAS a practical drop-in replacement for empirical tuning in production HPC and ML workloads.
