descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2015 English Publisher:Inderscience PublishersJournal:International Journal of Computational Science and Engineering, volume 11, page 391 (issn: 1742-7185, eissn: 1742-7193,

Authors: Hoque, Mohammad Asadul; Raju, Md Rezaul Karim; Tymczak, Christopher John; Vrinceanu, Daniel; Chilakamarri, Kiran;

doi: 10.1504/ijcse.2015.073498

Parallel sparse matrix-matrix multiplication: a scalable solution with 1D algorithm

- Summary
- Subjects
- Metrics

Abstract

This paper presents a novel implementation of parallel sparse matrix-matrix multiplication using distributed memory systems on heterogeneous hardware architecture. The proposed algorithm is expected to be linearly scalable up to several thousands of processors for matrices with dimensions over 10

Related Organizations

East Tennessee State University
United States
Texas Southern University
United States

Keywords

distributed computing, parallel algorithm, scalable, MPI, Sparse matrix, 004

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average