cs.DCApr 6, 2026

LP-GEMM: Integrating Layout Propagation into GEMM Operations

Authors: César Guedes Carneiro, Lucas Alvarenga, Guido Araujo, Sandro Rigo

Organizations: Instituto de Computação, Universidade Estadual de Campinas, Campinas – SP, Brazil

Abstract

In Scientific Computing and modern Machine Learning (ML) workloads, sequences of dependent General Matrix Multiplications (GEMMs) often dominate execution time. While state-of-the-art BLAS libraries aggressively optimize individual GEMM calls, they remain constrained by the BLAS API, which requires each call to independently pack input matrices and restore outputs to a canonical memory layout. In sequential GEMMs, these constraints cause redundant packing and unpacking, wasting valuable computational resources. This paper introduces LP-GEMM, a decomposition of the GEMM kernel that enables packing-layout propagation across sequential GEMM operations. This approach eliminates unnecessary data repacking while preserving full BLAS semantic correctness at the boundaries. We evaluate LP-GEMM on x86 (AVX-512) and RISC-V (RVV 1.0) architectures across MLP-like and Attention-like workloads. Our results show average speedups of 2.25x over OpenBLAS on Intel x86 for sequential GEMMs and competitive gains relative to vendor-optimized libraries such as Intel MKL. We demonstrate the practicality of the approach beyond microbenchmarks by implementing a standalone C++ version of the Llama-3.2 inference path using exclusively BLAS-level GEMM calls. These results confirm that leveraging data layout propagation between operations can significantly boost performance.

Figures & tables

Explore similar work

CardsList
  1. Space Filling Curves is All You Need: Communication-Avoiding Matrix Multiplication Made Simple

    Jan 22, 2026Evangelos Georganas, Alexander Heinecke, Pradeep DubeyHigh-Performance Computing

  2. SISA: A Scale-In Systolic Array for GEMM Acceleration

    Mar 31, 2026Luigi Altamura, Alessio Cicero, Mateo Vázquez Maceiras +2LLM Inference Acceleration