Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition

1978/09/01 by Fred G. Gustavson · 9 citations

paper · doi:10.1145/355791.355796

Cited by

• Bundle Adjustment in the Eager Mode
• gMAGNUS: Fast SpGEMM on GPUs for Irregular Matrices via Hierarchical Multisplit
• Accelerating Sparse Matrix-Matrix Multiplication on GPUs with Processing Near HBMs
• FuseFlow: A Fusion-Centric Compilation Framework for Sparse Deep Learning on Streaming Dataflow
• String Matching in (Block) Graphs: A Full Classification by Walk Length
• Output-Sparse Matrix Multiplication Using Compressed Sensing
• A Tensor Train Approach for Deterministic Arithmetic Operations on Discrete Representations of Probability Distributions
• Improving SpGEMM Performance Through Matrix Reordering and Cluster-wise Computation
• TriADA: Massively Parallel Trilinear Matrix-by-Tensor Multiply-Add Algorithm and Device Architecture for the Acceleration of 3D Discrete Transformations