Processor-efficient sparse matrix-vector multiplication
The authors consider the matrix-vector multiplication for sparse matrices which is the kernel of many numerical algorithms. After some preliminaries, a new measure of matrix sparsity called staircase width is introduced and some basic facts about this measure are formulated, proved and compared with other measure of sparsity like the stripe width and bandwidth using the University of Florida sparse matrix collection that have arisen in a variety of real applications. The staircase width of a matrix is never larger than the bandwidth or the stripe width. Usually, it is significantly smaller. Next, the generalized sparse matrix-vector multiplication algorithm for systolic arrays is introduced and analyzed together with the discussion about its correctness. Finally, some interesting results concerning the performance of the algorithm are presented. Summarizing, it is an interesting paper worth to be read.
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices
- A decomposition theorem for partially ordered sets
- A framework for run-time reconfigurable systems
- A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Algorithms for reducing the bandwidth and profile of a sparse matrix
- Block matrix multiplication and lu factorisation systolic arrays
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Determination of Stripe Structures for Finite Element Matrices
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1069171 (Why is no real title available?)
- scientific article; zbMATH DE number 819139 (Why is no real title available?)
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Laying Out Graphs Using Queues
- Minimizing the bandwidth of sparse symmetric matrices
- Parallel solution of linear systems with striped sparse matrices
- Stack and Queue Layouts of Directed Acyclic Graphs: Part I
- Stack and Queue Layouts of Directed Acyclic Graphs: Part II
- Stack and Queue Layouts of Posets
- Systolic Sorting on a Mesh-Connected Network
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Variable order panel clustering
- Parallel solution of linear systems with striped sparse matrices
- Sparse matrix multiplication package (SMMP)
- Cache oblivious sparse matrix multiplication
- A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
- Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
- Cache-efficient renumbering for vectorization
- Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
- Determination of Stripe Structures for Finite Element Matrices
- scientific article; zbMATH DE number 1218794 (Why is no real title available?)
- scientific article; zbMATH DE number 641555 (Why is no real title available?)
- The algorithms for FPGA implementation of sparse matrices multiplication
- On optimizing multiplications of sparse matrices
- The Local Queue Number of Graphs with Bounded Treewidth
- A Highly Efficient Implementation of Multiple Precision Sparse Matrix-Vector Multiplication and Its Application to Product-type Krylov Subspace Methods
- Fast multiplication and sparse structures
- Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors
- FPGA architecture and implementation of sparse matrix-vector multiplication for the finite element method
- Sparse matrix vector multiplication techniques on the IBM 3090 VF
This page was built for publication: Processor-efficient sparse matrix-vector multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1767967)
