arrow
Return

Accelerating CPU-Based Sparse General Matrix Multiplication With Binary Row Merging

delete2022-01-01
delete1
delete
OA
AI
Z
Zhaoyang Du *
Y
Yijin Guan
T
Tianchan Guan
D
Dimin Niu
H
Hongzhong Zheng
Y
Yuan Xie
DOI:10.1109/ACCESS.2022.3193937delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Sparse general matrix multiplication (SpGEMM) is a fundamental building block for many real-world applications. Since SpGEMM is a well-known memory-bounded application with vast and irregular memory accesses, considering the memory access efficiency is of critical importance for SpGEMM's performance. Yet, the existing methods put less consideration into the memory subsystem and achieved suboptimal performance. In this paper, we thoroughly analyze the memory access patterns of SpGEMM and their influences on the memory subsystem. Based on the analysis, we propose a novel and more efficient accumulation method named BRMerge for the multi-core CPU architectures. The BRMerge accumulation method follows the row-wise dataflow. It first accesses the B matrix, generates the intermediate lists for one output row, and stores these intermediate lists in a consecutive memory space, which is implemented by a ping-pong buffer. It then immediately merges these intermediate lists generated in the previous phase two by two in a tree-like hierarchy between two ping-pong buffers. The architectural benefits of BRMerge are 1) streaming access patterns, 2) minimized TLB cache miss rate, and 3) reasonably high L1/L2 cache hit rates, which result in both low access latency and high bandwidth utilization when performing SpGEMM. Based on the BRMerge accumulation method, we propose two SpGEMM libraries named BRMerge-Upper and BRMerge-Precise, which use different allocation methods. Performance evaluations with 26 commonly used benchmarks on two CPU servers show that the proposed SpGEMM libraries significantly outperform the state-of-the-art SpGEMM libraries.
Keywords:
Sparse general matrix multiplication
SpGEMM
multi-core CPU
parallel computing
high-performance computing

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

A
alibaba group
Scholars:
1.1K
Papers: 789
Citations: 0
Z
zhejiang university
Scholars:
17.7W
Papers: 12.1W
Citations: 152
Cited Papers

Cited Papers

EXPOSING FINE-GRAINED PARALLELISM IN ALGEBRAIC MULTIGRID METHODS
err2012-01-01
err141
PREAI
errBell, Nathan; Dalton, Steven; Olson, Luke N.
errShare
errSave
Prolonged electrophysiological maturation of transplanted hippocampal neurons
err1990-08-01
err0
PREAI
errLori A. Mudrick; Jasmine Stabel; Roland S.G. Jones; Uwe Heinemann
errShare
errSave
The measurement of acetylcholine turnover rate in brain structures
err1976-12-01
err0
PREAI
errG. Racagni; D.L. Cheney; G. Zsilla; E. Costa
errShare
errSave
GPU-ACCELERATED SPARSE MATRIX-MATRIX MULTIPLICATION BY ITERATIVE ROW MERGING
err2015-01-01
err71
PREAI
errGremse, Felix; Hoefter, Andreas; Schwen, Lars Ole; Kiessling, Fabian; Naumann, Uwe
errShare
errSave
researcher View more