mlsanityData to 14 Oct 2026

Tawa: Automatic Warp Specialization for Modern GPUs with Asynchronous References

arXiv 2510.14719 ↗First posted 16 Oct 2025cs.LG cs.AR cs.PLcited by 6

Not on the map. Why?

Abstract (arXiv)

Modern GPUs feature specialized hardware units that enable high-performance, asynchronous dataflow execution. However, the conventional SIMT programming model is fundamentally misaligned with this task-parallel hardware, creating a significant programmability gap. While hardware-level warp specialization is the key to unlocking peak performance, it forces developers to manually orchestrate complex, low-level communication and software pipelines--a process that is labor-intensive, error-prone, and unsustainable. To address this challenge, we present Tawa, an automated compiler that systematically generates high-performance, warp-specialized code from a high-level, tile-based program. Central to our approach is a novel IR abstraction, asynchronous references (aref), which expresses warp-level communication without exposing low-level hardware details. Using this abstraction, Tawa automatically partitions programs into producer-consumer roles and manages the intricate dataflow pipeline, relieving developers of invasive kernel rewriting. Evaluation on NVIDIA H100 GPUs across representative LLM kernels shows that Tawa delivers high hardware utilization, achieving up to 1.1× speedup over highly optimized cuBLAS GEMM kernels. For attention workloads, Tawa attains 1.2× speedup over Triton and matches the performance of the hand-optimized CUTLASS C++ FlashAttention-3 kernel with far less programming effort.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 20 of its 50 references that are in the map. First posted on arXiv 16 Oct 2025.

Builds on

20 of 50 references.

References · 20

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2024The Llama 3 Herd of Modelscited by 14,715
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  5. 2025Qwen3 Technical Reportcited by 8,820
  6. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  7. 2022Efficiently Scaling Transformer Inferencecited by 539
  8. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
  9. 2025FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Servingcited by 258
  10. 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 201
  11. 2020Data Movement Is All You Need: A Case Study on Optimizing Transformerscited by 108
  12. 2024AI and Memory Wallcited by 92
8 more
  1. 2025TileLang: A Composable Tiled Programming Model for AI Systemscited by 43
  2. 2023Understanding the Potential of FPGA-Based Spatial Acceleration for Large Language Model Inferencecited by 33
  3. 2022Tensor Program Optimization with Probabilistic Programscited by 30
  4. 2024Allo: A Programming Model for Composable Accelerator Designcited by 16
  5. 2023Relax: Composable Abstractions for End-to-End Dynamic Machine Learningcited by 12
  6. 2023Slapo: A Schedule Language for Progressive Optimization of Large Deep Learning Model Trainingcited by 11
  7. 2025Dato: A Task-Based Programming Model for Dataflow Acceleratorscited by 5
  8. 2025Task-Based Tensor Computations on Modern GPUscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 5.

6 papers.