.png){kind=icon}
返回
Optimizing nonzero-based sparse matrix partitioning models via reducing latency
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2018.08.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For the parallelization of sparse matrix-vector multiplication (SpMV) on distributed memory systems, nonzero-based fine-grain and medium-grain partitioning models attain the lowest communication volume and computational imbalance among all partitioning models. This usually comes, however, at the expense of high message count, i.e., high latency overhead. This work addresses this shortcoming by proposing new fine-grain and medium-grain models that are able to minimize communication volume and message count in a single partitioning phase. The new models utilize message nets in order to encapsulate the minimization of total message count. We further fine-tune these models by proposing delayed addition and thresholding for message nets in order to establish a trade-off between the conflicting objectives of minimizing communication volume and message count. The experiments on an extensive dataset of nearly one thousand matrices show that the proposed models improve the total message count of the original nonzero-based models by up to 27% on the average, which is reflected on the parallel runtime of SpMV as an average reduction of 15% on 512 processors. (C) 2018 Elsevier Inc. All rights reserved.
Keyword:
Sparse matrix
Space matrix-vector multiplication
Row-column-parallel SpMV
Load balancing
Communication overhead
Hypergraph
Fine-grain partitioning
Medium-grain partitioning
Recursive bipartitioning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
A two-dimensional data distribution method for parallel sparse matrix-vector multiplication.png)
SIAM REVIEWOAAI
SIAM REVIEWIF6.1
OAAI分享收藏HYPERGRAPH PARTITIONING BASED MODELS AND METHODS FOR EXPLOITING CACHE LOCALITY IN SPARSE MATRIX- VECTOR MULTIPLICATION基于超图划分的稀疏矩阵向量乘法中缓存局部性利用模型和方法OAAI
OAAI分享收藏分享收藏ON TWO-DIMENSIONAL SPARSE MATRIX PARTITIONING: MODELS, METHODS, AND A RECIPE关于二维稀疏矩阵分区: 模型，方法和配方
OAAI
OAAI分享收藏
查看更多内容