General matrix multiplication (GEMM) is the computational backbone of modern AI workloads, and its efficiency is critically dependent on effective tiling strategies. Conventional approaches employ symmetric tile buffering, where the buffered tile size of the input A along the dimension M matches the output tile size of C. In this paper, we introduce asymmetric tile buffering (ATB), a simple but powerful technique that decouples the buffered tile dimensions of the input and output operands. We show, for the first time, that ATB is both practical and highly beneficial. To explain this effect, we develop a performance model that incorporates both the benefits of ATB (higher arithmetic intensity) and its overheads (higher kernel switching costs), providing insight into how to select effective ATB tiling factors. As a case study, we apply ATB to AMD's latest XDNA2 AI Engine (AIE), achieving up to a 4.54x speedup, from 4.8 to 24.6 TFLOPS on mixed-precision BFP16--BF16 GEMM, establishing a new performance record for XDNA2 AIE.
@article{arxiv.2511.16041,
title = {Can Asymmetric Tile Buffering Be Beneficial?},
author = {Chengyue Wang and Wesley Pang and Xinrui Wu and Gregory Jun and Luis Romero and Endri Taka and Diana Marculescu and Tony Nowatzki and Pranathi Vasireddy and Joseph Melber and Deming Chen and Jason Cong},
journal= {arXiv preprint arXiv:2511.16041},
year = {2025}
}