MOSCON: Modified Outer Product based Sparse Matrix-Matrix Multiplication Accelerator with Configurable Tiles

被引:3
|
作者
Noble, G. [1 ]
Nalesh, S. [2 ]
Kala, S. [1 ]
机构
[1] Indian Inst Informat Technol Kottayam, Dept Elect & Commun Engn, Kottayam, Kerala, India
[2] Cochin Univ Sci & Technol, Dept Elect, Cochin, Kerala, India
关键词
Deep learning; Sparse matrix multiplication; Execution time; FPGA accelerator;
D O I
10.1109/VLSID57277.2023.00061
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
General Sparse Matrix-Matrix Multiplication (SpGEMM) which involves product of two sparse matrices is a key operation in many deep learning algorithms. Sparse matrices consist of only a few non-zero elements which makes it inefficient to use conventional matrix multiplication algorithms. Hence, specialized architectures for sparse matrix multiplication have been proposed. Prior works in this field uses outer product based implementation and they suffer due to poor load balance in the processing elements. We propose a modified outer product based sparse matrix-matrix multiplication architecture with configurable tiles, referred as MOSCON, which can be accelerated on Field Programmable Gate Arrays (FPGA). MOSCON can perform sparse matrix multiplication of any dimensions and takes the advantages of outer product implementation along with the features of load balanced architecture. Proposed architecture has been implemented on Xilinx Kintex-7 FPGA device and gives an average performance gain of 9.21% when compared with state-of-the-art implementations.
引用
收藏
页码:264 / 269
页数:6
相关论文
共 50 条
  • [21] PARALLEL SPARSE MATRIX-MATRIX MULTIPLICATION AND INDEXING: IMPLEMENTATION AND EXPERIMENTS
    Buluc, Aydin
    Gilbert, John R.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (04): : C170 - C191
  • [22] Accelerating sparse matrix-matrix multiplication with GPU Tensor Cores
    Zachariadis, Orestis
    Satpute, Nitin
    Gomez-Luna, Juan
    Olivares, Joaquin
    COMPUTERS & ELECTRICAL ENGINEERING, 2020, 88 (88)
  • [23] Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication
    Akbudak, Kadir
    Selvitopi, Oguz
    Aykanat, Cevdet
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2018, 4 (03)
  • [24] Sparse approximate matrix-matrix multiplication for density matrix purification with error control
    Artemov, Anton G.
    Rubensson, Emanuel H.
    JOURNAL OF COMPUTATIONAL PHYSICS, 2021, 438
  • [25] MatRaptor: A Sparse-Sparse Matrix Multiplication Accelerator Based on Row-Wise Product
    Srivastava, Nitish
    Jin, Hanchen
    Liu, Jie
    Albonesi, David
    Zhang, Zhiru
    2020 53RD ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO 2020), 2020, : 766 - 780
  • [26] Register-Aware Optimizations for Parallel Sparse Matrix-Matrix Multiplication
    Liu, Junhong
    He, Xin
    Liu, Weifeng
    Tan, Guangming
    INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 2019, 47 (03) : 403 - 417
  • [27] An Efficient GPU General Sparse Matrix-Matrix Multiplication for Irregular Data
    Liu, Weifeng
    Vinter, Brian
    2014 IEEE 28TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, 2014,
  • [28] Column-Segmented Sparse Matrix-Matrix Multiplication on Multicore CPUs
    An, Xiaojing
    Catalyurek, Umit, V
    2021 IEEE 28TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING, DATA, AND ANALYTICS (HIPC 2021), 2021, : 202 - 211
  • [29] Brief Announcement: Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Multiplication
    Ballard, Grey
    Druinsky, Alex
    Knight, Nicholas
    Schwartz, Oded
    SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 86 - 88
  • [30] Predicting optimal sparse general matrix-matrix multiplication algorithm on GPUs
    Wei, Bingxin
    Wang, Yizhuo
    Chang, Fangli
    Gao, Jianhua
    Ji, Weixing
    INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2024, 38 (03): : 245 - 259