Reducing Inter-Process Communication Overhead in Parallel Sparse Matrix-Matrix Multiplication

E-ISSN： 1938-0267|9|3|46-59

ISSN： 1938-0259

Source： International Journal of Grid and High Performance Computing (IJGHPC), Vol.9, Iss.3, 2017-07, pp. : 46-59

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Load-Balanced Sparse Matrix-Vector Multiplication on Parallel Computers

By Nastea S.G. Frieder O. El-Ghazawi T.

Journal of Parallel and Distributed Computing, Vol. 46, Iss. 2, 1997-11 ,pp. : 180-193

Academic Press

Access to resources Recommend Favorite

GPU accelerated sparse matrix‐vector multiplication and sparse matrix‐transpose vector multiplication

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 14, 2015-09 ,pp. : 3771-3789

John Wiley & Sons Inc

Access to resources Recommend Favorite

The problem of small and large matrices in parallel Matrix Multiplication

By Piano Cristiana

Parallel Algorithms and Applications, Vol. 18, Iss. 1-2, 2003-03 ,pp. : 71-89

Taylor & Francis Ltd

Access to resources Recommend Favorite

Reducing energy consumption of parallel sparse matrix applications through integrated link/CPU voltage scaling

By Son Seung Malkowski Konrad Chen Guilin Kandemir Mahmut Raghavan Padma

The Journal of Supercomputing, Vol. 41, Iss. 3, 2007-09 ,pp. : 179-213

Springer Publishing Company

Access to resources Recommend Favorite

Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method

By Zeiser Andreas

Journal of Scientific Computing, Vol. 47, Iss. 3, 2011-06 ,pp. : 328-346

Springer Publishing Company

Access to resources Recommend Favorite