VLSI Design

VLSI Design / 1999 / Article
Special Issue

High Performance Bus-Based Architectures

View this Special Issue

Open Access

Volume 9 |Article ID 032697 | https://doi.org/10.1155/1999/32697

Martin Middendorf, Hartmut Schmeck, Heiko Schröder, Gavin Turner, "Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes", VLSI Design, vol. 9, Article ID 032697, 13 pages, 1999. https://doi.org/10.1155/1999/32697

Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes

Received05 May 1997


Algorithms for multiplying several types of sparse n x n-matrices on dynamically reconfigurable n x n-arrays are presented. For some classes of sparse matrices constant time algorithms are given, e.g., when the first matrix has at most kn elements in each column or in each row and the second matrix has at most kn nonzero elements in each row, where k is a constant. Moreover, O(kn ) algorithms are obtained for the case that one matrix is a general sparse matrix with at most kn nonzero elements and the other matrix has at most k nonzero elements in every row or in every column. Also a lower bound of Ω(Kn ) is proved for this and other cases which shows that the algorithms are close to the optimum.

Copyright © 1999 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Order printed copiesOrder

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.