arrow
返回

Sparse matrix partitioning for optimizing SpMV on CPU-GPU heterogeneous platforms

delete2019-11-14
delete13
delete
OA
AI
M
Mohamed Akrem Benatia
W
Weixing Ji *
王
王一拙 (Yizhuo Wang)
F
Feng Shi
DOI:10.1177/1094342019886628delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Sparse matrix-vector multiplication (SpMV) kernel dominates the computing cost in numerous applications. Most of the existing studies dedicated to improving this kernel have been targeting just one type of processing units, mainly multicore CPUs or graphics processing units (GPUs), and have not explored the potential of the recent, rapidly emerging, CPU-GPU heterogeneous platforms. To take full advantage of these heterogeneous systems, the input sparse matrix has to be partitioned on different available processing units. The partitioning problem is more challenging with the existence of many sparse formats whose performances depend both on the sparsity of the input matrix and the used hardware. Thus, the best performance does not only depend on how to partition the input sparse matrix but also on which sparse format to use for each partition. To address this challenge, we propose in this article a new CPU-GPU heterogeneous method for computing the SpMV kernel that combines between different sparse formats to achieve better performance and better utilization of CPU-GPU heterogeneous platforms. The proposed solution horizontally partitions the input matrix into multiple block-rows and predicts their best sparse formats using machine learning-based performance models. A mapping algorithm is then used to assign the block-rows to the CPU and GPU(s) available in the system. Our experimental results using real-world large unstructured sparse matrices on two different machines show a noticeable performance improvement.
Keyword:
Sparse matrix-vector multiplication (SpMV)
CPU-GPU heterogeneous platforms
sparse matrix partitioning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of High Performance Computing Applications 封面图
International Journal of High Performance Computing Applications
IF:
2.5
论文数:
1.1K
被引数:
1.3K

机构

B
beijing institute of technology
学者数:
5.5W
论文数: 4.0W
被引数: 63
引用论文

引用论文

A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
err2001-06-01
err1.2K
errOAAI
errBraun, TD; Siegel, HJ; Beck, N; Bölöni, LL; Maheswaran, M; Reuther, AI; Robertson, JP; Theys, MD; Yao, B; Hensgen, D; Freund, RF
err分享
err收藏
学者 查看更多内容