A dynamic parameter tuning method for SpMM parallel execution

Summary Sparse matrix‐matrix multiplication (SpMM) is a basic kernel that is used by many algorithms. Several researches focus on various optimizations for SpMM parallel execution. However, a division of a task for parallelization is not well considered yet. Generally, a matrix is equally divided in...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2023-08, Vol.35 (17), p.n/a
Main Authors: Qi, Bin, Komatsu, Kazuhiko, Sato, Masayuki, Kobayashi, Hiroaki
Format: Article
Language:English
Subjects:
Algorithms
Mathematical analysis
Multiplication
parallel execution
parameter tuning
Parameters
Sparse matrices
sparse matrix‐matrix multiplication
Tuning
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Sparse matrix‐matrix multiplication (SpMM) is a basic kernel that is used by many algorithms. Several researches focus on various optimizations for SpMM parallel execution. However, a division of a task for parallelization is not well considered yet. Generally, a matrix is equally divided into blocks for processes even though the sparsities of input matrices are different. The parameter that divides a task into multiple processes for parallelization is fixed. As a result, load imbalance among the processes occurs. To balance the loads among the processes, this article proposes a dynamic parameter tuning method by analyzing the sparsities of input matrices. The experimental results show that the proposed method improves the performance of SpMM for examined matrices by up to 39.5% on a single vector engine and 3.49 × on a single CPU.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.6755