Primary Algorithm : Algorithmically, Sparse-Sparse multiplication problems manifests itself in three possible forms:(a) Multiplication of a sparse matrix with a sparse diagonal, sparse block-diagonal, ...

Abstract: The rising popularity of deep learning algorithms demands special accelerators for matrix-matrix multiplication. Most of the matrix multipliers are designed based on the systolic array ...

This project implements high-performance dense-dense, dense-sparse, and sparse-sparse matrix multiplication using C++ with configurable multi-threading, SIMD optimizations, and cache miss minimization ...

Abstract: Distributed computations, such as distributed matrix multiplication, can be vulnerable to significant security issues, notably Byzantine attacks. These attacks may target either worker nodes ...

“Several manufacturers have already started to commercialize near-bank Processing-In-Memory (PIM) architectures. Near-bank PIM architectures place simple cores close to DRAM banks and can yield ...

A novel AI-acceleration paper presents a method to optimize sparse matrix multiplication for machine learning models, particularly focusing on structured sparsity. Structured sparsity involves a ...

Discovering faster algorithms for matrix multiplication remains a key pursuit in computer science and numerical linear algebra. Since the pioneering contributions of Strassen and Winograd in the late ...