REVIEW 8 cited by
TileLang: A Composable Tiled Programming Model for AI Systems
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Modern AI workloads rely heavily on optimized computing kernels for both training and inference. These AI kernels follow well-defined data-flow patterns, such as moving tiles between DRAM and SRAM and performing a sequence of computations on those tiles. However, writing high-performance kernels remains complex despite the clarity of these patterns. Achieving peak performance requires careful, hardware-centric optimizations to fully leverage modern accelerators. While domain-specific compilers attempt to reduce the burden of writing high-performance kernels, they often struggle with usability and expressiveness gaps. In this paper, we present TileLang, a generalized tiled programming model for more efficient AI Kernel programming. TileLang decouples scheduling space (thread binding, layout, tensorize and pipeline) from dataflow, and encapsulated them as a set of customization annotations and primitives. This approach allows users to focus on the kernel's data-flow itself, while leaving most other optimizations to compilers. We conduct comprehensive experiments on commonly-used devices, across numerous experiments, our evaluation shows that TileLang can achieve state-of-the-art performance in key kernels, demonstrating that its unified block-and-thread paradigm and transparent scheduling capabilities deliver both the power and flexibility demanded by modern AI system development.
Forward citations
Cited by 8 Pith papers
-
Triton for MTIA: Bridging the Programming Model Gaps for Custom AI Accelerators
A Triton compiler backend, TorchInductor adaptations, and small language extensions let Meta's MTIA-2i run Triton kernels competitively with expert-tuned C++ in production.
-
Characterizing Real-World Bugs in Tile Programs for Automated Bug Detection
A taxonomy of 301 real tile-program codegen bugs: 48.8% are type/operator bugs, 19.3% are memory bugs, and detection needs shape-aware fuzzing plus differential oracles.
-
Dato: A Task-Based Programming Model for Dataflow Accelerators
Dato introduces first-class stream and layout types plus an automatic virtual-to-physical mapping search, reporting up to 2.81x speedups on AMD NPUs and 98% of theoretical peak on an FPGA.
-
GPU-Tile-Sim: A Tile-Centric GPU Simulation Framework for LLM Hardware-Software Co-Design
A tile-graph GPU simulator predicts optimized LLM kernel performance on A100/H100 with MAPE about 1–9% by modeling dependencies and overlap rather than full instruction pipelines.
-
RotateAttention: RoPE-Aware Rotation and Range Rectification for INT4 Quantized Attention in Video Generation
RoPE-aware orthogonal rotations plus full-range INT4 quantization of attention probabilities deliver mixed-precision FlashAttention that matches FP16 video quality at 1.5–1.68× end-to-end speedup.
-
ContextMaster: Interactive Multi-Shot Video Creation via Fixed-Budget Sparse Context Routing
A unified video model with role-aware context and fixed-budget sparse attention enables interactive multi-shot generation, reference conditioning, and editing at 16 FPS on a single GPU.
-
Three non-Hermitian random matrix universality classes of complex edge statistics: Spacing ratios and distributions
Three non-Hermitian edge universality classes show distinct repulsion, universal cubic small-spacing behaviour, and incomplete unfolding by complex spacing ratios at the edge.
-
GPU Kernel Scientist: An LLM-Driven Framework for Iterative Kernel Optimization
An LLM agent loop iteratively optimized a HIP GEMM kernel for AMD MI300 using only end-to-end timings, reaching about 450µs versus 850µs for the PyTorch reference.
Discussion (0). Sign in to comment.