In:
Concurrency and Computation: Practice and Experience, Wiley, Vol. 35, No. 17 ( 2023-08)
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
1532-0626
,
1532-0634
Language:
English
Publisher:
Wiley
Publication Date:
2023
detail.hit.zdb_id:
2052606-4
SSG:
11
Permalink
