Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results

DOI10.1016/0020-0190(94)00046-8zbMath0802.65053OpenAlexW1996678870MaRDI QIDQ1329416

Giovanni Manzini

Publication date: 11 December 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00046-8

zbMATH Keywords

parallel algorithmsaverage complexitydistributed architecturessparse matrix vector multiplication

Mathematics Subject Classification ID

Related Items (1)

MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗

Cites Work

• Techniques for parallel manipulation of sparse matrices
• Sparse matrix computations on the hypercube and related networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results