paper-with-me

Papers

High Throughput Matrix-Matrix Multiplication between Asymmetric Bit-Width Operands

2020-08-03 · Dibakar Gope, Jesse Beu, Matthew Mattina

Matrix multiplications between asymmetric bit-width operands, especially between 8- and 4-bit operands are likely to become a fundamental kernel of many important workloads including neural networks and machine learning. While existing SIMD matrix multiplication instructions for symmetric bit-width operands can support operands of mixed precision by zero- or sign-extending the narrow operand to match the size of the other operands, they cannot exploit the benefit of narrow bit-width of one of the operands. We propose a new SIMD matrix multiplication instruction that uses mixed precision on its inputs (8- and 4-bit operands) and accumulates product values into narrower 16-bit output accumulators, in turn allowing the SIMD operation at 128-bit vector width to process a greater number of data elements per instruction to improve processing throughput and memory bandwidth utilization without increasing the register read- and write-port bandwidth in CPUs. The proposed asymmetric-operand-size SIMD instruction offers 2x improvement in throughput of matrix multiplication in comparison to throughput obtained using existing symmetric-operand-size instructions while causing negligible (0.05%) overflow from 16-bit accumulators for representative machine learning workloads. The asymmetric-operand-size instruction not only can improve matrix multiplication throughput in CPUs, but also can be effective to support multiply-and-accumulate (MAC) operation between 8- and 4-bit operands in state-of-the-art DNN hardware accelerators (e.g., systolic array microarchitecture in Google TPU, etc.) and offer similar improvement in matrix multiply performance seamlessly without violating the various implementation constraints. We demonstrate how a systolic array architecture designed for symmetric-operand-size instructions could be modified to support an asymmetric-operand-sized instruction.

📄 PDF Abstract BibTeX arXiv:2008.00638

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningVocal Bursts Intensity Prediction

Similar Papers 제목 키워드 기반

Fast, Scalable, Energy-Efficient Non-element-wise Matrix Multiplication on FPGA

2024-07-02 · Xuqi Zhu, Huaizhi Zhang, JunKyu Lee, Jiacheng Zhu 외

Modern Neural Network (NN) architectures heavily rely on vast numbers of multiply-accumulate arithmetic operations, constituting the predominant computational cost. Therefore, this paper proposes a high-throughput, scala…

Management

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

2026-01-22 · Evangelos Georganas, Alexander Heinecke, Pradeep Dubey arxiv

General Matrix Multiplication (GEMM) is the cornerstone of HPC workloads and Deep Learning. State-of-the-art vendor libraries tune tensor layouts, parallelization schemes, and cache blocking to minimize data movement acr…

A matrix math facility for Power ISA(TM) processors

2021-04-07 · José E. Moreira, Kit Barton, Steven Battle, Peter Bergner 외

Power ISA(TM) Version 3.1 has introduced a new family of matrix math instructions, collectively known as the Matrix-Multiply Assist (MMA) facility. The instructions in this facility implement numerical linear algebra ope…

Math

Hyperspectral In-Memory Computing with Optical Frequency Combs and Programmable Optical Memories

2023-10-17 · Mostafa Honari Latifpour, Byoung Jun Park, Yoshihisa Yamamoto, Myoung-Gyun Suh

The rapid advancements in machine learning across numerous industries have amplified the demand for extensive matrix-vector multiplication operations, thereby challenging the capacities of traditional von Neumann computi…

Random Sampling for Distributed Coded Matrix Multiplication

2019-05-16 · Wei-Ting Chang, Ravi Tandon

Matrix multiplication is a fundamental building block for large scale computations arising in various applications, including machine learning. There has been significant recent interest in using coding to speed up distr…