Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
verfasst von : Gero Greiner, Riko Jacob
Erschienen in: LATIN 2010: Theoretical Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We consider the multiplication of a sparse
N
×
N
matrix
A
with a dense
N
×
N
matrix
B
in the I/O model. We determine the worst-case non-uniform complexity of this task up to a constant factor for all meaningful choices of the parameters
N
(dimension of the matrices),
k
(average number of non-zero entries per column or row in
A
, i.e., there are in total
kN
non-zero entries),
M
(main memory size), and
B
(block size), as long as
M
≥
B
2
(tall cache assumption).
For large and small
k
, the structure of the algorithm does not need to depend on the structure of the sparse matrix
A
, whereas for intermediate densities it is possible and necessary to find submatrices that fit in memory and are slightly denser than on average.
The focus of this work is asymptotic worst-case complexity, i.e., the existence of matrices that require a certain number of I/Os and the existence of algorithms (sometimes depending on the shape of the sparse matrix) that use only a constant factor more I/Os.