MEGA Hub

A Thread-Register Decoupled GPU Execution Model for Efficient Tensor Computation

Authors

Do you know Zihan Liu?You can claim authorship or link another user.Do you know Jingwen Leng?You can claim authorship or link another user.Do you know Yangjie Zhou?You can claim authorship or link another user.Do you know Yitong Ding?You can claim authorship or link another user.Do you know Guanlin Zhu?You can claim authorship or link another user.Do you know Yilu Huang?You can claim authorship or link another user.Do you know Chiheng Jin?You can claim authorship or link another user.Do you know Chen Zhang?You can claim authorship or link another user.Do you know Shixuan Sun?You can claim authorship or link another user.Do you know Yu Feng?You can claim authorship or link another user.Do you know Anbang Wu?You can claim authorship or link another user.Do you know Minyi Guo?You can claim authorship or link another user.Do you know Jian Weng?You can claim authorship or link another user.Do you know Jiajin Tu?You can claim authorship or link another user.Do you know Junsong Wang?You can claim authorship or link another user.

Abstract

Modern GPUs increasingly integrate Tensor Cores into the execution pipeline. Although aggregate tensor throughput continues to grow, aided by an operand supply that has evolved from register-based in Ampere to redundancy-free, memory-based in Hopper and Blackwell, efficiently orchestrating the complete tensor compute pipeline for the modern AI workloads remains challenging. We identify the fundamental bottlenecks as fixed parallelism and coarse-grained scheduling, both of which are exposed by modern AI workloads that interleave diverse non-GEMM operations with GEMM. To orchestrate tensor computation efficiently, we propose FIBER, a new architecture that extends the GPU SIMT (single instruction, multiple thread) model. Its basic execution instance, the \emph{fiber}, is decoupled from private register ownership, carrying only minimal control state while accessing an SM's registers through a shared view. This enables dynamic parallelism scaling, fine-grained register-level dataflow scheduling, and offers a redundancy-free alternative for matrix operand supply. We extend the ISA, microarchitecture, and compiler to realize shared-register addressing, conflict-free operand delivery, and fiber-based program mapping. Under a typical mixed-precision LLM serving scenario, FIBER achieves a 2.25x end-to-end speedup on Ampere (1.15x for the original FP16 computation), with 1.8x and 2.09x on Hopper and Blackwell respectively, and kernel-level gains up to 2.49x.

Community

00